Web services discovery and composition as graph search problem

Seog Chan Oh; Byung Won On; Eric J. Larson; Dongwon Lee

Web services discovery and composition as graph search problem

Seog Chan Oh, Byung Won On, Eric J. Larson, Dongwon Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

When there are a large number of web services available (e.g., in the range of 1,000 - 10,000), it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to "compose" multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. Toward this problem, in this paper, we present a novel solution, named as BF* (BF-Star), that adopts the competitive A* as a search algorithm while utilizing the Bloom Filter as a succinct data structure.

Original language	English (US)
Title of host publication	Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05
Pages	784-786
Number of pages	3
State	Published - Dec 1 2005
Event	2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05 - Hong Kong, China Duration: Mar 29 2005 → Apr 1 2005

Publication series

Name	Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05

Other

Other	2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05
Country/Territory	China
City	Hong Kong
Period	3/29/05 → 4/1/05

All Science Journal Classification (ASJC) codes

General Engineering

Cite this

@inproceedings{c7b2f519e37640bf822d6f01abe11e68,

title = "Web services discovery and composition as graph search problem",

abstract = "When there are a large number of web services available (e.g., in the range of 1,000 - 10,000), it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to {"}compose{"} multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. Toward this problem, in this paper, we present a novel solution, named as BF* (BF-Star), that adopts the competitive A* as a search algorithm while utilizing the Bloom Filter as a succinct data structure.",

author = "Oh, {Seog Chan} and On, {Byung Won} and Larson, {Eric J.} and Dongwon Lee",

year = "2005",

month = dec,

day = "1",

language = "English (US)",

isbn = "0769522742",

series = "Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05",

pages = "784--786",

booktitle = "Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05",

note = "2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05 ; Conference date: 29-03-2005 Through 01-04-2005",

}

Oh, SC, On, BW, Larson, EJ & Lee, D 2005, Web services discovery and composition as graph search problem. in Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05. Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05, pp. 784-786, 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05, Hong Kong, China, 3/29/05.

Web services discovery and composition as graph search problem. / Oh, Seog Chan; On, Byung Won; Larson, Eric J. et al.
Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05. 2005. p. 784-786 (Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Web services discovery and composition as graph search problem

AU - Oh, Seog Chan

AU - On, Byung Won

AU - Larson, Eric J.

AU - Lee, Dongwon

PY - 2005/12/1

Y1 - 2005/12/1

N2 - When there are a large number of web services available (e.g., in the range of 1,000 - 10,000), it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to "compose" multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. Toward this problem, in this paper, we present a novel solution, named as BF* (BF-Star), that adopts the competitive A* as a search algorithm while utilizing the Bloom Filter as a succinct data structure.

AB - When there are a large number of web services available (e.g., in the range of 1,000 - 10,000), it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to "compose" multiple web services to fulfill the goal. Since the search space for such a composition problem is in general exponentially increasing, it is important to have wise decision on underlying data structures and search algorithms. Toward this problem, in this paper, we present a novel solution, named as BF* (BF-Star), that adopts the competitive A* as a search algorithm while utilizing the Bloom Filter as a succinct data structure.

UR - http://www.scopus.com/inward/record.url?scp=30944460120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=30944460120&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:30944460120

SN - 0769522742

SN - 9780769522746

T3 - Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05

SP - 784

EP - 786

BT - Proceedings - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05

T2 - 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service, EEE-05

Y2 - 29 March 2005 through 1 April 2005

ER -

Web services discovery and composition as graph search problem

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this