Inheritance-Aware Document-Driven Service Composition

In this paper, we proposed a fast service composition method to solve the semantic composition problem defined by WS-Challenge. We construct an inverted table to index the services according to their output attributes. Based on the index, we developed the algorithms for service discovery and composition. Thanks to the high speed of service lookup through the index, our algorithm gains a high performance.

[1]  Tao Li,et al.  SWSDS: Quick Web Service Discovery and Composition in SEWSIP , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[2]  Shankar Ponnekanti,et al.  SWORD: A Developer Toolkit for Web Service Composition , 2008 .

[3]  Stanley Y. W. Su,et al.  AND/OR Graph and Search Algorithm for Discovering Composite Web Services , 2005, Int. J. Web Serv. Res..

[4]  Marco Aiello,et al.  Web Service Indexing for Efficient Retrieval and Composition , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[5]  Soundar R. T. Kumara,et al.  Algorithms for Web Services Discovery and Composition Based on Syntactic and Semantic Service Descriptions , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[6]  Miroslaw Malek,et al.  Current solutions for Web service composition , 2004, IEEE Internet Computing.

[7]  Mike P. Papazoglou,et al.  Introduction: Service-oriented computing , 2003, CACM.