Optimizing distributed joins with bloom filters

Sukriti Ramesh, Odysseas Papapetrou, Wolf Siberski

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationDistributed Computing and Internet Technology - 5th International Conference, ICDCIT 2008, Proceedings
Pages145-156
Number of pages12
DOIs
Publication statusPublished - 1 Dec 2008
Externally publishedYes
Event5th International Conference on Distributed Computing and Internet Technology, ICDCIT 2008 - New Delhi, India
Duration: 10 Dec 200812 Dec 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5375 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Distributed Computing and Internet Technology, ICDCIT 2008
CountryIndia
CityNew Delhi
Period10/12/0812/12/08

Fingerprint Dive into the research topics of 'Optimizing distributed joins with bloom filters'. Together they form a unique fingerprint.

Cite this