The Community for Technology Leaders
RSS Icon
Subscribe
Hong Kong, China
Mar. 29, 2005 to Apr. 1, 2005
ISBN: 0-7695-2274-2
pp: 784-786
Seog-Chan Oh , IE / Penn State
Byung-Won On , CSE / Penn State
Eric J. Larson , IST / Penn State
Dongwon Lee , IST / Penn State
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.
INDEX TERMS
null
CITATION
Seog-Chan Oh, Byung-Won On, Eric J. Larson, Dongwon Lee, "BF*: Web Services Discovery and Composition as Graph Search Problem", EEE, 2005, e-Technology, e-Commerce, and e-Services, IEEE International Conference on, e-Technology, e-Commerce, and e-Services, IEEE International Conference on 2005, pp. 784-786, doi:10.1109/EEE.2005.41
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool