MISQ: a UML-based analytical modeling methodology for optimizing web service composition
BSN '05 Proceedings of the IEEE EEE05 international workshop on Business services networks
A comparative illustration of AI planning-based web services composition
ACM SIGecom Exchanges
Distributed automatic service composition in large-scale systems
Proceedings of the second international conference on Distributed event-based systems
A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
A Logical Reasoning Approach to Automatic Composition of Stateless Components
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
An Optimal and Complete Algorithm for Automatic Web Service Composition
International Journal of Web Services Research
Hi-index | 0.00 |
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.