The Community for Technology Leaders
RSS Icon
Subscribe
Atlanta, GA, USA
April 3, 2006 to April 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
ABSTRACT
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>
INDEX TERMS
null
CITATION
Ken Pu, Vagelis Hristidis, Nick Koudas, "Syntactic Rule Based Approach toWeb Service Composition", ICDE, 2006, 22nd International Conference on Data Engineering, 22nd International Conference on Data Engineering 2006, pp. 31, doi:10.1109/ICDE.2006.153
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool