基于语义检索树的服务动态组合算法  

Automatic Dynamic Services Composition Based on Semantic Web Service Query Tree

作　　者：钱海忠[1,2] 沈苏彬[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210023 [2]江苏教育学院数学与信息技术学院,江苏南京210013

出　　处：《南京邮电大学学报（自然科学版）》2013年第2期72-79,共8页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

基　　金：国家高技术研究发展计划(863计划)(2006AA01Z208);国家自然科学基金(60273091;90412002)资助项目

摘　　要：在动态执行环境下自动、高效的选择各类异构的万维网服务并进行有效的组合是语义万维网服务研究的一大热点。本文提出了语义检索树的概念以及构造方法。通过构造语义检索树,对所有注册服务的信息进行有效地组织并支持服务快速语义检索,然后采用归约思想来简化组合流程自动生成。与现有算法相比,本文提出的方法不仅能有效降低服务检索空间,而且在某个原子服务失效时能快速选择替代服务。场景案例及实验结果进一步证明了该方法优于其它同类算法。It is a challenge problem in semantic web service to select and composite a automatically heterogeneous web service in runtime. This paper presents a semantic query tree and a service compositing algorithm. Firstly, web services are organized effectively and quick query service algorithm based on semantic is presented by means of a tree. Then,based on reductive method, the proposed compositing algorithm is expressed simply as an automatic generating workflow. Compared with the existing approaches, it can not only reduce querying space effectively and select alternative service quickly when a primitive service is invalidated, but also can satisfy multi-aim. The experiment shows the feasibility and efficiency of the algorithm.

关 键 词：万维网服务语义检索树 语义万维网 万维网服务组合 

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