Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Specification matching of software components
ACM Transactions on Software Engineering and Methodology (TOSEM)
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
Large Scale, Type-Compatible Service Composition
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Flexible and Efficient Matchmaking and Ranking in Service Directories
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Scalable automated service composition using a compact directory digest
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Recent algorithms for automated service composition issue many complex queries to service directories. As service directories are shared resources, they may become performance bottlenecks. In order to increase scalability, we introduce a compact directory digest, which is distributed to clients and includes all information needed for automated service composition. Therefore, complex directory queries during service composition can be avoided. We encode a directory digest as a Zero-Suppressed Reduced Ordered Binary Decision Diagram (ZDD). In several steps, we refine a simple service composition algorithm in order to leverage the ZDD representation. Introducing specialized ZDD operations, we achieve a service composition algorithm that scales very well with an increasing size of the directory digest.