Welcome to the InfoSci Platform
Reference Hub1
Optimal Service Ordering in Decentralized Queries Over Web Services

Optimal Service Ordering in Decentralized Queries Over Web Services

Efthymia Tsamoura, Anastasios Gounaris, Yannis Manolopoulos
Copyright: © 2011 |Volume: 1 |Issue: 2 |Pages: 16
ISSN: 2155-6393|EISSN: 2155-6407|EISBN13: 9781613508282|DOI: 10.4018/ijkbo.2011040101
Cite Article Cite Article

MLA

Tsamoura, Efthymia, et al. "Optimal Service Ordering in Decentralized Queries Over Web Services." IJKBO vol.1, no.2 2011: pp.1-16. http://doi.org/10.4018/ijkbo.2011040101

APA

Tsamoura, E., Gounaris, A., & Manolopoulos, Y. (2011). Optimal Service Ordering in Decentralized Queries Over Web Services. International Journal of Knowledge-Based Organizations (IJKBO), 1(2), 1-16. http://doi.org/10.4018/ijkbo.2011040101

Chicago

Tsamoura, Efthymia, Anastasios Gounaris, and Yannis Manolopoulos. "Optimal Service Ordering in Decentralized Queries Over Web Services," International Journal of Knowledge-Based Organizations (IJKBO) 1, no.2: 1-16. http://doi.org/10.4018/ijkbo.2011040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The problem of ordering expensive predicates (or filter ordering) has recently received renewed attention due to emerging computing paradigms such as processing engines for queries over remote Web Services, and cloud and grid computing. The optimization of pipelined plans over services differs from traditional optimization significantly, since execution takes place in parallel and thus the query response time is determined by the slowest node in the plan, which is called the bottleneck node. Although polynomial algorithms have been proposed for several variants of optimization problems in this setting, the fact that communication links are typically heterogeneous in wide-area environments has been largely overlooked. The authors propose an attempt to optimize linear orderings of services when the services communicate directly with each other and the communication links are heterogeneous. The authors propose a novel optimal algorithm to solve this problem efficiently. The evaluation of the proposal shows that it can result in significant reductions of the response time.

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.