2006 European Conference on Web Services (ECOWS'06) 2006
DOI: 10.1109/ecows.2006.2
|View full text |Cite
|
Sign up to set email alerts
|

A Graph-Based Framework for Composition of Stateless Web Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
36
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 57 publications
(39 citation statements)
references
References 6 publications
0
36
0
Order By: Relevance
“…And our evaluation consists of two parts. First, we compare SUTB [4] with our method by the precision and composition time. Then we carry out some experiments on the test sets which are generated by the WSC 2009 Testset Generator to evaluate the method furthermore.…”
Section: Experiments and Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…And our evaluation consists of two parts. First, we compare SUTB [4] with our method by the precision and composition time. Then we carry out some experiments on the test sets which are generated by the WSC 2009 Testset Generator to evaluate the method furthermore.…”
Section: Experiments and Resultsmentioning
confidence: 99%
“…Some approaches, such as [5,6], tackle Web service composition problem via AI planning. On the other hand, some other researches [4,10] regards it as a graph search problem and solves it by shortest path, A*, etc. algorithms.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Different approaches graph [6] [9],Petrinet [10], Description logic [8],FSM [4] are used to generate composite services. To scale up the service composition RDBMS based approach is used in [7].…”
Section: Related Workmentioning
confidence: 99%
“…Each service provides certain set of functionalities and these are exposed to the external world by interfaces for service search. The existing service search approaches are based on these interface descriptions e.g I/O match [6][3] and protocol match [5]. When a single service does not satisfy search request, a set of services are combined to meet the need.…”
Section: Introductionmentioning
confidence: 99%