Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries
Küçük Resim Yok
Tarih
2017
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Igi Global
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Adaptive Query Optimization, Bloom Filter, Distributed Query Processing, Join Methods, Linked Data, Query Federation
Kaynak
International Journal of Data Warehousing and Mining
WoS Q Değeri
Q4
Scopus Q Değeri
Q4
Cilt
13
Sayı
3
