An Integrated Semantic Web Service Discovery and Composition Framework

Abstract

In this paper we present a theoretical analysis of graph-based service\ncomposition in terms of its dependency with service discovery. Driven by this\nanalysis we define a composition framework by means of integration with\nfine-grained I/O service discovery that enables the generation of a graph-based\ncomposition which contains the set of services that are semantically relevant\nfor an input-output request. The proposed framework also includes an optimal\ncomposition search algorithm to extract the best composition from the graph\nminimising the length and the number of services, and different graph\noptimisations to improve the scalability of the system. A practical\nimplementation used for the empirical analysis is also provided. This analysis\nproves the scalability and flexibility of our proposal and provides insights on\nhow integrated composition systems can be designed in order to achieve good\nperformance in real scenarios for the Web.\n