By Topic

BF*: Web services discovery and composition as graph search problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. -C. Oh ; Pennsylvania State Univ., University Park, PA, USA ; B. -W. On ; E. J. Larson ; D. Lee

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.

Published in:

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

Date of Conference:

29 March-1 April 2005