Referenced Items are not available for this document.
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
- Page(s):
- 64 - 69
- Print ISBN:
- 0-7695-2751-5
- INSPEC Accession Number:
- 9343145
- Conference Location :
- Guangzhou, Guangdong
- Digital Object Identifier :
- 10.1109/APSCC.2006.28
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
