基于组合索引的语义Web服务发现算法  

Semantic Web Service Discovery Algorithm Based on Combined Index

作　　者：申建刚[1] 王理[1] 

机构地区：[1]北京航空航天大学经济管理学院,北京100083

出　　处：《计算机工程》2010年第15期4-6,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(70671007)

摘　　要：为提高Web服务发现的效率,将倒排索引和功能兼容性索引相结合,设计一种组合索引方法。组合索引由服务的加权简洁功能兼容图和输出概念的图节点倒排索引构成。基于组合索引,提出一种服务发现算法,与基于倒排索引和功能兼容性索引的服务发现算法的对比分析表明,该算法能够明显减少功能兼容性检查的次数和平均索引链长,具有较优的性能。A combined index method,integrated with the inverted index and the function compatibility index,is designed to improve the efficiency of Web service discovery.The combined index is composed of the Weighted Compact Function Compatibility-Graph（WCFC-Graph） for Web service and the inverted index for the nodes in WCFC-Graph based on ontology-annotated output.Using the combined index,a service discovery algorithm is proposed.Comparison to discovery algorithm based on inverted index and function compatibility index,shows that the proposed algorithm is able to significantly reduce the times of function-compatibility check and the average length of service per output,and has best performance.

关 键 词：WEB服务 服务发现 服务索引 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]