Reference Hub4
A Flexible Directory Query Language for the Efficient Processing of Service Composition Queries

A Flexible Directory Query Language for the Efficient Processing of Service Composition Queries

Walter Binder, Ion Constantinescu, Boi Faltings
Copyright: © 2007 |Volume: 4 |Issue: 1 |Pages: 21
ISSN: 1545-7362|EISSN: 1546-5004|ISSN: 1545-7362|EISBN13: 9781615204540|EISSN: 1546-5004|DOI: 10.4018/jwsr.2007010104
Cite Article Cite Article

MLA

Binder, Walter, et al. "A Flexible Directory Query Language for the Efficient Processing of Service Composition Queries." IJWSR vol.4, no.1 2007: pp.59-79. http://doi.org/10.4018/jwsr.2007010104

APA

Binder, W., Constantinescu, I., & Faltings, B. (2007). A Flexible Directory Query Language for the Efficient Processing of Service Composition Queries. International Journal of Web Services Research (IJWSR), 4(1), 59-79. http://doi.org/10.4018/jwsr.2007010104

Chicago

Binder, Walter, Ion Constantinescu, and Boi Faltings. "A Flexible Directory Query Language for the Efficient Processing of Service Composition Queries," International Journal of Web Services Research (IJWSR) 4, no.1: 59-79. http://doi.org/10.4018/jwsr.2007010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Service composition is a major challenge in an open environment populated by large numbers of heterogeneous services. In such a setting, the efficient interaction of directory-based service discovery with service composition engines is crucial. In this article we present a Java-based directory that offers special functionality enabling effective service composition. In order to optimize the interaction of the directory with different service composition algorithms exploiting application-specific heuristics, the directory supports user-defined selection and ranking functions written in a declarative query language. Inside the directory queries are transformed and compiled to JVM bytecode which is dynamically linked into the directory. The compiled query enables a best-first search of matching directory entries, efficiently pruning the search space.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.