Scalable and efficient web services composition based on a relational database

Lee, Daewook; Kwon, Joonho; Lee, Sang-Jun; Park, Seog; Hong, Bonghee

doi:10.1016/j.jss.2011.05.068

Cited by 53 publications

(36 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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].…”

Section: Database-based Composition Methodsmentioning

confidence: 99%

“…Another work [17] deals with the problem we address here. The authors put forward a PSR system, in which service compositions are computed in advance and stored in tables of relational database.…”

Section: Database-based Composition Methodsmentioning

confidence: 99%

“…Attempts to resolve the service composition problems have resulted in the utilization of relational database [17], [18], [19]. They use "join" operators to connect matched services, these services are seen as new available services.…”

Section: ) a Tourist Wants To Travel From Montreal To Chicagomentioning

confidence: 99%

“…They use "join" operators to connect matched services, these services are seen as new available services. The PSR (Pre-computing Solutions in RDBMS) system developed by Lee uses joins and indices to connect services as paths and stores paths in a database [17]. The PSR system abstracts services as single operators, while handling user queries with multiple inputs and outputs, this system returns all paths which meet part of user requests.…”

Section: ) a Tourist Wants To Travel From Montreal To Chicagomentioning

confidence: 99%

See 3 more Smart Citations

Full Solution Indexing for Top-K Web Service Composition

Yan

Lemire

2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Abstract-Automated service composition fulfills complex tasks by combining different existing web services together. Unfortunately, optimizing service composition is still a challenging area that needs to be addressed. In this article, we propose a novel relational database approach for automated service composition. All possible service combinations are generated beforehand and stored in a relational database. When a user request comes, our system composes SQL queries to search in the database and return the best Quality of Service (QoS) solutions. We test the performance of the proposed system with a web service challenge data set. Our experimental results demonstrate that this system can always find top-K valid solutions to satisfy user's functional and non-functional requirements.

show abstract

Section: Database-based Composition Methodsmentioning

confidence: 99%

Section: Database-based Composition Methodsmentioning

confidence: 99%

Section: ) a Tourist Wants To Travel From Montreal To Chicagomentioning

confidence: 99%

Section: ) a Tourist Wants To Travel From Montreal To Chicagomentioning

confidence: 99%

See 2 more Smart Citations

Full Solution Indexing for Top-K Web Service Composition

Yan

Lemire

2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…Lee, et al, propose a scalable and efficient web services composition method based on a relational database [5], they develop a web services composition search system called PSR. The PSR system stores the graph into tables and computes answers for semantic web services composition search in advance by joining Tables.…”

Section: Related Workmentioning

confidence: 99%

Research on Semantic Web Service Composition Based on Binary Tree

Mao¹,

Zang²,

Niu³

2015

IJGDC

View full text Add to dashboard Cite

show abstract

Performance formula‐based optimal deployments of multilevel indices for service retrieval

Liu

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

Summary There are many different index structures for service repositories, such as sequential index, inverted index, and multilevel indices that include three deployments. Different service sets maybe have different characteristics that may affect performance from different aspects. For a given service set, which index structure is the most optimal one? To address these issues, this paper analyses five indexing models and proposes expectation of traversed service count to estimate performance of service retrieval. Based on these expectation formulas, an optimal deployment method can be identified to maximize efficiency of service retrieval. Our experiments first validate correctness of the proposed formulas and then validate the effective of the optimal method.

show abstract

Scalable and efficient web services composition based on a relational database

Cited by 53 publications

References 9 publications

Full Solution Indexing for Top-K Web Service Composition

Full Solution Indexing for Top-K Web Service Composition

Research on Semantic Web Service Composition Based on Binary Tree

Performance formula‐based optimal deployments of multilevel indices for service retrieval

Contact Info

Product

Resources

About