TY - GEN
T1 - Optimizing distributed joins with bloom filters
AU - Ramesh, Sukriti
AU - Papapetrou, Odysseas
AU - Siberski, Wolf
PY - 2008/12/1
Y1 - 2008/12/1
N2 - Distributed joins have gained importance in the past decade, mainly due to the increased number of available data sources on the Internet. In this work we extend Bloomjoin, the state of the art algorithm for distributed joins, so that it minimizes the network usage for the query execution based on database statistics. We present 4 extensions of the algorithm, and construct a query optimizer for selecting the best extension for each query. Our theoretical analysis and experimental evaluation shows significant network cost savings compared to the original Bloomjoin algorithm.
AB - Distributed joins have gained importance in the past decade, mainly due to the increased number of available data sources on the Internet. In this work we extend Bloomjoin, the state of the art algorithm for distributed joins, so that it minimizes the network usage for the query execution based on database statistics. We present 4 extensions of the algorithm, and construct a query optimizer for selecting the best extension for each query. Our theoretical analysis and experimental evaluation shows significant network cost savings compared to the original Bloomjoin algorithm.
UR - http://www.scopus.com/inward/record.url?scp=58449091473&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-89737-8_15
DO - 10.1007/978-3-540-89737-8_15
M3 - Conference contribution
AN - SCOPUS:58449091473
SN - 3540897364
SN - 9783540897361
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 145
EP - 156
BT - Distributed Computing and Internet Technology - 5th International Conference, ICDCIT 2008, Proceedings
T2 - 5th International Conference on Distributed Computing and Internet Technology, ICDCIT 2008
Y2 - 10 December 2008 through 12 December 2008
ER -