IDEAS home Printed from https://ideas.repec.org/a/igg/jdwm00/v13y2017i3p47-72.html
   My bibliography  Save this article

Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries

Author

Listed:
  • Damla Oguz

    (Institute of Research in Computer Science of Toulouse (IRIT), Paul Sabatier University, Toulouse, France & Department of Computer Engineering, Izmir Institute of Technology, Izmir, Turkey & Department of Computer Engineering, Ege University, Izmir, Turkey)

  • Shaoyi Yin

    (Institute of Research in Computer Science of Toulouse (IRIT), Paul Sabatier University, Toulouse, France)

  • Belgin Ergenç

    (Department of Computer Engineering, Izmir Institute of Technology, Izmir, Turkey)

  • Abdelkader Hameurlain

    (Institute of Research in Computer Science of Toulouse (IRIT), Paul Sabatier University, Toulouse, France)

  • Oguz Dikenelli

    (Department of Computer Engineering, Ege University, Izmir, Turkey)

Abstract

The goal of query optimization in query federation over linked data is to minimize the response time and the completion time. Communication time has the highest impact on them both. Static query optimization can end up with inefficient execution plans due to unpredictable data arrival rates and missing statistics. This study is an extension of adaptive join operator which always begins with symmetric hash join to minimize the response time, and can change the join method to bind join to minimize the completion time. The authors extend adaptive join operator with bind-bloom join to further reduce the communication time and, consequently, to minimize the completion time. They compare the new operator with symmetric hash join, bind join, bind-bloom join, and adaptive join operator with respect to the response time and the completion time. Performance evaluation shows that the extended operator provides optimal response time and further reduces the completion time. Moreover, it has the adaptation ability to different data arrival rates.

Suggested Citation

  • Damla Oguz & Shaoyi Yin & Belgin Ergenç & Abdelkader Hameurlain & Oguz Dikenelli, 2017. "Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 13(3), pages 47-72, July.
  • Handle: RePEc:igg:jdwm00:v:13:y:2017:i:3:p:47-72
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDWM.2017070103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:jdwm00:v:13:y:2017:i:3:p:47-72. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.