Improving distributed join efficiency with extended bloom filter operations

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • Harvard University
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings
Subtitle of host publication21st International Conference on Advanced Information Networking and Applications, AINA 2007
Pages187-194
Number of pages8
ISBN (electronic)978-1-5090-8717-4
Publication statusPublished - 2007
Event21st International Conference on Advanced Information Networking and Applications (AINA 2007) - Niagara Falls, ON, Canada
Duration: 21 May 200723 May 2007
Conference number: 21

Publication series

NameProceedings - International Conference on Advanced Information Networking and Applications, AINA
ISSN (Print)1550-445X

Abstract

Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potential of bloom filters has not yet been exploited. Especially in the case of multi-joins, where the data is distributed among several sites, additional optimization opportunities arise, which require new bloom filter operations and computations. In this paper, we present these extensions and point out how they improve the performance of such distributed joins. While the paper focuses on efficient join computation, the described extensions are applicable to a wide range of usages, where bloom filters are facilitated for compressed set representation.

ASJC Scopus subject areas

Cite this

Improving distributed join efficiency with extended bloom filter operations. / Michael, Loizos; Nejdl, Wolfgang; Papapetrou, Odysseas et al.
Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007. 2007. p. 187-194 4220893 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Michael, L, Nejdl, W, Papapetrou, O & Siberski, W 2007, Improving distributed join efficiency with extended bloom filter operations. in Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007., 4220893, Proceedings - International Conference on Advanced Information Networking and Applications, AINA, pp. 187-194, 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Niagara Falls, ON, Canada, 21 May 2007. https://doi.org/10.1109/AINA.2007.80
Michael, L., Nejdl, W., Papapetrou, O., & Siberski, W. (2007). Improving distributed join efficiency with extended bloom filter operations. In Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007 (pp. 187-194). Article 4220893 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA). https://doi.org/10.1109/AINA.2007.80
Michael L, Nejdl W, Papapetrou O, Siberski W. Improving distributed join efficiency with extended bloom filter operations. In Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007. 2007. p. 187-194. 4220893. (Proceedings - International Conference on Advanced Information Networking and Applications, AINA). doi: 10.1109/AINA.2007.80
Michael, Loizos ; Nejdl, Wolfgang ; Papapetrou, Odysseas et al. / Improving distributed join efficiency with extended bloom filter operations. Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007. 2007. pp. 187-194 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).
Download
@inproceedings{1016e451f6cd45d193aa0695256a3b75,
title = "Improving distributed join efficiency with extended bloom filter operations",
abstract = "Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potential of bloom filters has not yet been exploited. Especially in the case of multi-joins, where the data is distributed among several sites, additional optimization opportunities arise, which require new bloom filter operations and computations. In this paper, we present these extensions and point out how they improve the performance of such distributed joins. While the paper focuses on efficient join computation, the described extensions are applicable to a wide range of usages, where bloom filters are facilitated for compressed set representation.",
author = "Loizos Michael and Wolfgang Nejdl and Odysseas Papapetrou and Wolf Siberski",
year = "2007",
doi = "10.1109/AINA.2007.80",
language = "English",
isbn = "978-076952846-5",
series = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",
pages = "187--194",
booktitle = "Proceedings",
note = "21st International Conference on Advanced Information Networking and Applications (AINA 2007) ; Conference date: 21-05-2007 Through 23-05-2007",

}

Download

TY - GEN

T1 - Improving distributed join efficiency with extended bloom filter operations

AU - Michael, Loizos

AU - Nejdl, Wolfgang

AU - Papapetrou, Odysseas

AU - Siberski, Wolf

N1 - Conference code: 21

PY - 2007

Y1 - 2007

N2 - Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potential of bloom filters has not yet been exploited. Especially in the case of multi-joins, where the data is distributed among several sites, additional optimization opportunities arise, which require new bloom filter operations and computations. In this paper, we present these extensions and point out how they improve the performance of such distributed joins. While the paper focuses on efficient join computation, the described extensions are applicable to a wide range of usages, where bloom filters are facilitated for compressed set representation.

AB - Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potential of bloom filters has not yet been exploited. Especially in the case of multi-joins, where the data is distributed among several sites, additional optimization opportunities arise, which require new bloom filter operations and computations. In this paper, we present these extensions and point out how they improve the performance of such distributed joins. While the paper focuses on efficient join computation, the described extensions are applicable to a wide range of usages, where bloom filters are facilitated for compressed set representation.

UR - http://www.scopus.com/inward/record.url?scp=34548799148&partnerID=8YFLogxK

U2 - 10.1109/AINA.2007.80

DO - 10.1109/AINA.2007.80

M3 - Conference contribution

AN - SCOPUS:34548799148

SN - 978-076952846-5

T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA

SP - 187

EP - 194

BT - Proceedings

T2 - 21st International Conference on Advanced Information Networking and Applications (AINA 2007)

Y2 - 21 May 2007 through 23 May 2007

ER -

By the same author(s)