An Integrated Semantic Web Service Discovery and Composition Framework
This work addresses the challenge of efficient service composition in real-world Web scenarios, though it appears incremental by building on existing graph-based methods.
The paper tackles the problem of integrating service discovery with graph-based service composition for the Semantic Web, resulting in a framework that improves scalability and flexibility, as demonstrated through empirical analysis.
In this paper we present a theoretical analysis of graph-based service composition in terms of its dependency with service discovery. Driven by this analysis we define a composition framework by means of integration with fine-grained I/O service discovery that enables the generation of a graph-based composition which contains the set of services that are semantically relevant for an input-output request. The proposed framework also includes an optimal composition search algorithm to extract the best composition from the graph minimising the length and the number of services, and different graph optimisations to improve the scalability of the system. A practical implementation used for the empirical analysis is also provided. This analysis proves the scalability and flexibility of our proposal and provides insights on how integrated composition systems can be designed in order to achieve good performance in real scenarios for the Web.