Efficient Web Service Composition and Intelligent Search Based on Relational Database

Full Solution Indexing for Top-K Web Service Composition

“…However, loading lots of services information into RAM is expensive, and the search space is limited by the available physical memory. These shortcomings have motivated researchers to utilize relational database to solve service composition problem [17], [19], [38].…”

“…They use "join" operator to find service composition by matching services. Zeng et al in [38] present a web service matching algorithm (SMA), this algorithm considers semantic similarity based on WordNet. Moreover, they put forward a Fast-EP service composition algorithm which can be applied in relational database.…”

RDBMS for service repository and composition

“…They also propose a web service composition search algorithm called PSR(Pre-computing solutions for WSC in a RDBMS) that uses simple SQL statements.PSR system supports web services having single Input and Output parameters and can handle web services having multiple input and output parameters.C. Zheng et al [11] put forward a new storage strategy for web services which can be flexibly extended in relational database. They present a matching algorithm SMA between web services of multiple input/output parameters, which considers the semantic similarity of concepts in parameters based on WordNet.…”

“…Most of the existing algorithms [3][4][5][6]7,9,11,12] for service composition construct chains of services based on exact matches of input/output parameters to satisfy a given query.However,the making of a chain fails at a point when inputs of a succeeding(I S ) service does not match exactly with the outputs (O P ) of a preceeding service.Here the proposed approach alleviate this problem by making match criteria flexible.In addition to exact match we allow partial as well as super match for conditions O P ⊂ I S and O P ⊃ I S respectively.Partial match is of our interest and here we have shown the possibility of successful service composition by collaboration of services that make only partial matches.In case of traditional matching following exact match criteria we would not have ever discovered possible compositions satisfying user requirements.…”

No Application Is an Island: Using Topes to Transform Strings during Data Transfer

“…In addition to differences in the representation of individual values, two applications can differ in how they combine values into hierarchical structures. This problem, called "schema heterogeneity" [6] [8], has attracted decades of research in many settings including relational databases, XML, web services, and the semantic web (e.g., [1] [16]). Some of these approaches for overcoming schema heterogeneity are extremely sophisticated.…”