2011
DOI: 10.1016/j.jss.2011.05.068
|View full text |Cite
|
Sign up to set email alerts
|

Scalable and efficient web services composition based on a relational database

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
35
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 53 publications
(36 citation statements)
references
References 9 publications
0
35
0
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%
See 3 more Smart Citations
“…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%
See 2 more Smart Citations
“…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%