The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2006)
Atlanta, Georgia
Apr. 3, 2006 to Apr. 7, 2006
ISBN: 0-7695-2570-9
pp: 31
Ken Pu , University of Toronto
Vagelis Hristidis , Florida National International University
Nick Koudas , University of Toronto
This paper studies a problem of web service composition from a syntactic approach. In contrast with other approaches on enriched semantic description such as statetransition description of web services, our focus is in the case when only the input-output type information from the WSDL specifications is available. <p>The web service composition problem is formally formulated as deriving a given desired type from a collection of available types and web services using a prescribed set of rules with costs. We show that solving the minimal cost composition is NP-complete in general, and present a practical solution based on dynamic programming. Experiements using a mixture of synthetic and real data sets show that our approach is viable and produces good results.</p>
Ken Pu, Vagelis Hristidis, Nick Koudas, "Syntactic Rule Based Approach toWeb Service Composition", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 31, 2006, doi:10.1109/ICDE.2006.153
97 ms
(Ver 3.3 (11022016))