Efficient Web Services Composition Search System based on a Reachability

Abstract

In this paper, we proposed an efficient web services composition search system, called SCR, based on the reachability relation and the max length property. In contrast to previous work, the SCR system consists of two phases : a pre-computing phase and a query phase. In the pre-computing phase, we build edge sets and compute all-pairs reachability relation and the max length property. In the querying phase, we find web services composition using only the web services which are reachable from input/ouput parameters of an user query. Experimental results show that our SCR system provides good performance over data sets with different characteristics.