Selection and ranking of propositional formulas for large-scale service directories

Authors:
Ion Constantinescu;Walter Binder;Boi Faltings
Affiliations:
Ecole Polytechnique Fédérale de Lausanne, Artificial Intelligence Laboratory, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Artificial Intelligence Laboratory, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Artificial Intelligence Laboratory, Lausanne, Switzerland
Venue:
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Year:
2005

Citing 8
Cited 0

Zero-suppressed BDDs for set manipulation in combinatorial problems

DAC '93 Proceedings of the 30th international Design Automation Conference
Fast planning through planning graph analysis

Artificial Intelligence
Semantical and computational aspects of Horn approximations

Artificial Intelligence
Generalizing "Search'' in Generalized Search Trees (Extended Abstract)

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Generalized Search Trees for Database Systems

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Semantic Matching of Web Services Capabilities

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Efficient Matchmaking and Directory Services

WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
Large Scale, Type-Compatible Service Composition

ICWS '04 Proceedings of the IEEE International Conference on Web Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider scenarios, such as web service composition, where a planner needs to discover its operators by querying a potentially very large and dynamically changing directory. Our contribution is a directory system that represents service advertisements and requests as propositional formulas and provides a flexible query language allowing complex selection and ranking expressions. The internal structure of the directory enables efficient selection and ranking in the presence of a large number of services thanks to its organization as a balanced tree with an extra "intersection predicate". In order to optimally exploit the index structure of the directory, a transformation scheme is applied to the original query. Experimental results on randomly generated service composition problems illustrate the benefits of our approach.