SG: A Structure based Web Services Matching Framework

摘要

Dynamic Web Services discovery has taken more and more important role in enterprise application integration. So how to find the most accurate services becomes research focus nowadays. In this paper, we put forward a novel matching mechanism based on structural information of services besides on syntax and semantics. The structural information is viewed as the invocation sequence of a series of services performing the users' task defined as Service Graph which makes service discovery and composition issue as graph isomorphism and matching problem. Finally we provide a novel Web Services discovery framework based on syntactic, Service Graph and semantic matching to find the exact services that meets the users' goal.