A Graph-Based Approach to Web Service Matchmaking

Abstract

Web service discovery is the process of locating web services to meet requirements of service requesters, and is an important ingredient in building loosely-coupled SOA-based applications. In this paper, we propose a graph-based web service matchmaking approach based on WSDL without additional meta data or annotations. We divide the service matchmaking approach into two principal themes: constructing request graphs (RG) and service signature graphs (SSG) and calculating distance and similarity between a RG and an SSG. There are three main benefits in the proposed approach: (1) the structure of a service and involved data types are considered in the matching process, (2) the providers do not need to spent considerable effort annotating the service description using tags or ontology models, and (3) both the crisp similarity and fuzzy similarity can be produced automatically.