EconPapers    
Economics at your fingertips  
 

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

Damla Oguz, Shaoyi Yin, Belgin Ergenç, Abdelkader Hameurlain and Oguz Dikenelli
Additional contact information
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

International Journal of Data Warehousing and Mining (IJDWM), 2017, vol. 13, issue 3, 47-72

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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJDWM.2017070103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jdwm00:v:13:y:2017:i:3:p:47-72

Access Statistics for this article

International Journal of Data Warehousing and Mining (IJDWM) is currently edited by Eric Pardede

More articles in International Journal of Data Warehousing and Mining (IJDWM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().

 
Page updated 2025-03-19
Handle: RePEc:igg:jdwm00:v:13:y:2017:i:3:p:47-72