Bloom Filters: One Size Fits All?

Waldvogel, Marcel; Hurley, Paul

Bloom Filters: One Size Fits All?

Files

Hurley_Waldvogel.pdf(338.04 KB)

Date

2007

Authors

Waldvogel, Marcel

Hurley, Paul

Project

High-Speed Router Functions

Collections

Informatik und Informationswissenschaft

Publication type

Contribution to a conference collection

Published in

32nd IEEE Conference on Local Computer Networks (LCN 2007). - IEEE, 2007. - pp. 183-190. - ISBN 0-7695-3000-1

Abstract

Bloom filters impress by their sheer elegance and have become a widely and indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal. Notably in application areas where false negatives are tolerable, other techniques can clearly be better. We show that, at least for a specific area in the parameter space, Bloom filters are significantly outperformed even by a simple scheme. We show that many application areas where Bloom filters are deployed do not require the strong policy of no false negatives and sometimes even prefer false negatives. We analyze, through modelling, how far Bloom filters are from the optimal and then examine application specific issues in a distributed web caching scenario. We hope to open up and seed discussion towards domain-specific alternatives to Bloom filters while perhaps sparking ideas for a general-purpose alternative.

Subject (DDC)

004 Computer Science

Keywords

Bloom Filter

Conference

32nd IEEE Conference on Local Computer Networks (LCN 2007), Oct 15, 2007 - Oct 18, 2007, Dublin, Ireland

Cite This

ISO 690

WALDVOGEL, Marcel, Paul HURLEY, 2007. Bloom Filters: One Size Fits All?. 32nd IEEE Conference on Local Computer Networks (LCN 2007). Dublin, Ireland, Oct 15, 2007 - Oct 18, 2007. In: 32nd IEEE Conference on Local Computer Networks (LCN 2007). IEEE, pp. 183-190. ISBN 0-7695-3000-1. Available under: doi: 10.1109/LCN.2007.17

BibTex

@inproceedings{Waldvogel2007-10Bloom-12631,
  year={2007},
  doi={10.1109/LCN.2007.17},
  title={Bloom Filters: One Size Fits All?},
  isbn={0-7695-3000-1},
  publisher={IEEE},
  booktitle={32nd IEEE Conference on Local Computer Networks (LCN 2007)},
  pages={183--190},
  author={Waldvogel, Marcel and Hurley, Paul}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/12631">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-10T10:15:48Z</dcterms:available>
    <dcterms:bibliographicCitation>First publ. in: IEEE Computer Society, 32nd IEEE Conference on Local Computer Networks, 2007, pp.183-190</dcterms:bibliographicCitation>
    <dc:contributor>Hurley, Paul</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:rights>terms-of-use</dc:rights>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Bloom Filters: One Size Fits All?</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12631/1/Hurley_Waldvogel.pdf"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/12631/1/Hurley_Waldvogel.pdf"/>
    <dc:creator>Hurley, Paul</dc:creator>
    <dc:creator>Waldvogel, Marcel</dc:creator>
    <dc:contributor>Waldvogel, Marcel</dc:contributor>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">Bloom filters impress by their sheer elegance and have become a widely and indiscriminately used tool in network applications, although, as we show, their performance can often be far from optimal. Notably in application areas where false negatives are tolerable, other techniques can clearly be better. We show that, at least for a specific area in the parameter space, Bloom filters are significantly outperformed even by a simple scheme. We show that many application areas where Bloom filters are deployed do not require the strong policy of no false negatives and sometimes even prefer false negatives. We analyze, through modelling, how far Bloom filters are from the optimal and then examine application specific issues in a distributed web caching scenario. We hope to open up and seed discussion towards domain-specific alternatives to Bloom filters while perhaps sparking ideas for a general-purpose alternative.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-10T10:15:48Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12631"/>
    <dcterms:issued>2007-10</dcterms:issued>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes