Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Proceedings |
| Untertitel | 21st International Conference on Advanced Information Networking and Applications, AINA 2007 |
| Seiten | 187-194 |
| Seitenumfang | 8 |
| ISBN (elektronisch) | 978-1-5090-8717-4 |
| Publikationsstatus | Veröffentlicht - 2007 |
| Veranstaltung | 21st International Conference on Advanced Information Networking and Applications (AINA 2007) - Niagara Falls, ON, Kanada Dauer: 21 Mai 2007 → 23 Mai 2007 Konferenznummer: 21 |
Publikationsreihe
| Name | Proceedings - 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 Sachgebiete
- Ingenieurwesen (insg.)
- Allgemeiner Maschinenbau
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Proceedings: 21st International Conference on Advanced Information Networking and Applications, AINA 2007. 2007. S. 187-194 4220893 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
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 -