Framework for Web service query algebra and optimization
ACM Transactions on the Web (TWEB)
A tag-based approach for the design and composition of information processing applications
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Efficient IR-Style Search over Web Services
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
ANGIE: active knowledge for interactive exploration
Proceedings of the VLDB Endowment
WSXplorer: searching for desired web services
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Active knowledge: dynamically enriching RDF knowledge bases by web services
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Web services discovery and rank: An information retrieval approach
Future Generation Computer Systems
Mining social tags to predict mashup patterns
SMUC '10 Proceedings of the 2nd international workshop on Search and mining user-generated contents
Combining query-by-example and query expansion for simplifying web service discovery
Information Systems Frontiers
Using naming tendencies to syntactically link web service messages
DEECS'06 Proceedings of the Second international conference on Data Engineering Issues in E-Commerce and Services
A Social-Aware Service Recommendation Approach for Mashup Creation
International Journal of Web Services Research
| Hi-index | 0.00 |
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. 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.