An Integrated Semantic Web Service Discovery and Composition Framework

TL;DR

This paper introduces a comprehensive framework for semantic web service discovery and composition, integrating graph-based methods with fine-grained I/O discovery, and includes an optimal search algorithm and scalability enhancements.

Contribution

It presents a novel integrated framework combining service discovery and composition with graph optimization and an optimal search algorithm for scalable web service composition.

Findings

Framework demonstrates scalability and flexibility in empirical analysis.

Graph optimizations improve system performance.

The approach effectively generates semantically relevant service compositions.

Abstract

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.