We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Efficient Algorithm for Web Services Composition with a Chain Data Structure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li Lian ; Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan ; Jun Ma ; Zhumin Chen ; ling Song

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(log m,n)), improved the known O(n times log m) 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

Published in:

Services Computing, 2006. APSCC '06. IEEE Asia-Pacific Conference on

Date of Conference:

Dec. 2006