Indexing method for effective web service retrieval

Abstract

This paper addresses the problem of web service retrieval by presenting a new approach to indexing of both SOAP and RESTful web services. The approach uses index structure called parametric index that allows users to retrieve ranked results in accordance with specific parameters. The parameters refer to service's integral components and are covered in presented formal definition of a web service. Secondly, the services are modelled in vector space that allows the evaluation of their mutual relevance and enables obtaining ranked search results. In order to reduce the index size and to decrease the search time, presented approach uses the method of conceptual indexing which groups relevant service components into concepts. For further search performance improvement, this paper also introduces the concept of merged weight vector. The research is supported by novel indexing algorithm and implementation of proposed approach. Experimental results confirm that the presented approach significantly reduces the index size. It also improves search performance in contrast to standard indexing algorithm and compared to k-means and self-organising maps clustering algorithms.Keywords: indexing method; web service retrieval; effective retrieval; information retrieval; intelligent information systems; intelligent database systems.Reference to this paper should be made as follows: Czyszczoń, A. and Zgrzywa, A. (2014) 'Indexing method for effective web service retrieval', Int.

A bitwise-based indexing and heuristic-driven on-the-fly approach for Web service composition and verification

“…There have been many given suggestions to resolve this problem, such as clustering [6,7], or indexing [8,9]. In the clustering approach, we have to address a variety of problems, such as how to compute the similarity between services, how many clusters should be generated, or which clustering algorithm should be chosen, etc.…”

“…Alternatively, indexing is considered as a simple and effective approach to reduce the composition time. In literature, there are many ways to index, such as using the hashtable [8] or using the weighted vector [9]. However, in these approaches, the construction of index structure and the application of the processing functions are in high complexity.…”

“…Regarding the novelty of the work presented in this paper, we want to note that using model checking to solve the Web service composition or Web service verification has already been reported in [5,10,[12][13][14]. Likewise, Web service indexing for faster composition is also not a new idea, see [8,9,15]. However, this paper is the first work proposing the combination of these two techniques.…”

“…Czyszczo and Aleksander in [9] proposed the solution for the problem of Web service retrieval by presenting a new approach to indexing of both SOAP and RESTful Web services. This approach uses index structure called parametric index that allows users to retrieve ranked results in accordance with specific parameters.…”

“…To reduce the index size and to decrease the search time, the approach in [9] uses the method of conceptual indexing which groups relevant service components into concepts. Table 8 presents the functional comparison our tool with others previously discussed.…”