IDEAS home Printed from
   My bibliography  Save this article

Optimal Service Ordering in Decentralized Queries Over Web Services


  • Efthymia Tsamoura

    (Aristotle University of Thessaloniki, Greece)

  • Anastasios Gounaris

    (Aristotle University of Thessaloniki, Greece)

  • Yannis Manolopoulos

    (Aristotle University of Thessaloniki, Greece)


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.

Suggested Citation

  • Efthymia Tsamoura & Anastasios Gounaris & Yannis Manolopoulos, 2011. "Optimal Service Ordering in Decentralized Queries Over Web Services," International Journal of Knowledge-Based Organizations (IJKBO), IGI Global, vol. 1(2), pages 1-16, April.
  • Handle: RePEc:igg:jkbo00:v:1:y:2011:i:2:p:1-16

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jkbo00:v:1:y:2011:i:2:p:1-16. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Journal Editor). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.