发布/订阅系统语义Web匹配算法  

Semantic Web-based matching algorithm for publish/subscribe systems

作　　者：冯锡炜[1] 汪俭华[1] 冯瑶[1] 林培光[2] 

机构地区：[1]辽宁石油化工大学计算机与通信工程学院,抚顺113001 [2]山东财政学院计算机学院,济南250014

出　　处：《北京科技大学学报》2013年第4期544-550,共7页Journal of University of Science and Technology Beijing

基　　金：国家自然科学基金资助项目(60172044);辽宁省教育厅科学研究资助项目(L2011055);辽宁省教育科学"十二五"规划立项资助课题(JG11DB163;JG12DB27);辽宁石油化工大学科学基金资助项目(2011XJJ-018)

摘　　要：将语义Web技术引入发布/订阅系统中,结合领域本体,提出一种智能匹配算法.以双索引哈希邻接表,结合谓词表、变量约束表和变量类型表作为订阅条件RDF图模式的数据结构,采用元语句级匹配计数方法,使原子订阅条件仅匹配一次,原子订阅条件间"与关系"的顺序匹配.定量和定性分析了算法的时间和空间复杂度.实验结果比较表明,所设计的智能匹配算法具有较高的订阅匹配效率,适合于大规模发布/订阅系统.The semantic Web technology was introduced into publish/subscribe systems and an intelligent seman- tic matching algorithm （ISMA） was proposed by domain ontology. With double-index hash tables, predicate, variable filter and type tables as the data structure of resource description framework （RDF） graph patterns which stores subscrip- tion conditions, the algorithm adopts meta-statement match counting method to efficiently process atomic subscription factor match only once, and the subscription conditions are an ＂and＂ serial sequence matching relationship. The time and space complexities of the algorithm were derived and analyzed by quantitative and qualitative methods. Experi- mental results demonstrate that the algorithm is efficient and scalable, and it is suitable for large-scale publish/subscribe systems.

关 键 词：算法 语义WEB WEB服务 发布 订阅系统 哈希函数 本体论 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]