RDBMS for Service Repository and Matchmaking

Abstract

Web Services is an upcoming technology in the current Internet revolution. Web Services have a potential to enhance Business to Business collaboration by composing compatible services to a service of higher dimension. Two services are composable only if there is a matching between their conversation protocol. For modeling and matching of conversations, the usability of formal structure like Finite State Machine (FSM) is well studied. However, we are in a opinion that storing, matchmaking and retrieving FSMs using graph structure is not scalable for representing conversation protocol for thousands of web services that will soon be available on web. In order to cope up with the challenge we propose relational model to store FSMs and a query system to retrieve services that are matching to a given service.