Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
3 results
Search Results
Now showing 1 - 3 of 3
Article Citation - WoS: 1Citation - Scopus: 1Extended Adaptive Join Operator With Bind-Bloom Join for Federated Sparql Queries(IGI Global Publishing, 2017) Oğuz, Damla; Yin, Shaoyi; Ergenç, Belgin; Hameurlain, Abdelkader; Dikenelli, OğuzThe 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.Conference Object Citation - Scopus: 2Adaptive Join Operator for Federated Queries Over Linked Data Endpoints(Springer Verlag, 2016) Oğuz, Damla; Yin, Shaoyi; Hameurlain, Abdelkader; Ergenç, Belgin; Dikenelli, OğuzTraditional static query optimization is not adequate for query federation over linked data endpoints due to unpredictable data arrival rates and missing statistics. In this paper, we propose an adaptive join operator for federated query processing which can change the join method during the execution. Our approach always begins with symmetric hash join in order to produce the first result tuple as soon as possible and changes the join method as bind join when it estimates that bind join is more efficient than symmetric hash join for the rest of the process. We compare our approach with symmetric hash join and bind join. Performance evaluation shows that our approach provides optimal response time and has the adaptation ability to the different data arrival rates.Article Citation - WoS: 17Citation - Scopus: 26Federated Query Processing on Linked Data: a Qualitative Survey and Open Challenges(Cambridge University Press, 2015) Oğuz, Damla; Ergenç, Belgin; Yin, Shaoyi; Dikenelli, Oğuz; Hameurlain, AbdelkaderA large number of data providers publish and connect their structured data on the Web as linked data. Thus, the Web of data becomes a global data space. In this paper, we initially give an overview of query processing approaches used in this interlinked and distributed environment, and then focus on federated query processing on linked data. We provide a detailed and clear insight on data source selection, join methods and query optimization methods of existing query federation engines. Furthermore, we present a qualitative comparison of these engines and give a complementary comparison of the measured metrics of each engine with the idea of pointing out the major strengths of each one. Finally, we discuss the major challenges of federated query processing on linked data. © 2015 Cambridge University Press.