A refined service relationships graph generation algorithm for Web Services composition

Graph-based search algorithms, established on service relationship graph, are a kind of Web Service automatic composition approach. However, it is difficult to construct the graph when service repository contains a large quantity of services possessed intricate semantic relationship. With the respect to handle these problems, we proposed a novel algorithm. In this paper, we first append semantic notation to service description by using OWL. Second, we introduce MessagePart Matrix and its subordinate structures according to WSDL service model, and then define five operations for the matrix, which is used for the determination of relationship between two given services. Finally, we show the algorithm insisting of the structures and operations mentioned before as well as the detail process executed on the motivating example. We also evaluate the proposed method, and the result shows that the algorithm can be used to select the candidate services required by composition effectively.