An Efficient Algorithm for Web Services Composition with a Chain Data Structure
Automatic composition of web services has drawn a great deal of attention recently. Current web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(logm,n)), improved the known O(n × logm) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure.
web services services composition WS chain table algorithm
Lian Li Ma Jun Chen ZhuMin Song Ling
The School of Computer Science and Technology, Shandong University, JiNan, 250061, China
国际会议
2006 Asia-Pacific Services Computing Conference(IEEE亚太地区服务计算会议)
广州
英文
64-69
2006-12-12（万方平台首次上网日期，不代表论文的发表时间）