摘要
随着Web服务的迅速发展,Web服务组合已经成为一个研究的热点。但是如何找到行之有效的Web服务组合方法仍然是研究人员需要解决的难题。针对这个问题,提出了一个高效的Web服务构造树算法。该算法引入了Web服务前提集的概念,并用贪婪算法和索引算法来构造Web服务前提集。实验表明索引算法具有更好的性能。
Web service composition has become a hotspot of research with the rapid development of Web service： However, it is always a problem for the researchers to find an effective way of Web service composition. This article proposes an efficient algorithm of Web services composition constructed tree aiming at solving this problem. This algorithm introduces the concept of pre-condition set of Web service, and uses both greedy algorithm and index algorithm to construct the pre-eondition set of Web service. Experiment indicates that the index algorithm has better performance than the greedy algorithm.
出处
《计算机应用与软件》
CSCD
2010年第8期169-171,共3页
Computer Applications and Software
关键词
WEB服务组合
构造树
前提条件集
Web service composition Constructed tree Pre-condition set
