A Web Service Composition Method Based on Compact K2-Trees


With the advent of cloud computing, a significant number of web services are available on the Internet. Services can be combined together when user's requirements are too complex to be solved by individual services. Since there are many services, searching a solution may require much storage. We propose to apply a compact data structure to represent the web service composition graph. To the best of our knowledge, our work is the first attempt to consider compact structure in solving the web service composition problem. Experimental results show that our method can find a valid solution to the composition problem, meanwhile, it takes less space and shows good scalability when handling a large number of web services.

DOI: 10.1109/SCC.2015.62

8 Figures and Tables

Cite this paper

@article{Li2015AWS, title={A Web Service Composition Method Based on Compact K2-Trees}, author={Jing Li and Yuhong Yan and Daniel Lemire}, journal={2015 IEEE International Conference on Services Computing}, year={2015}, pages={403-410} }