Bloom Filters: One Size Fits All?

Cite This

Files in this item

Checksum: MD5:556aca9a993ddf7cbecdc11854d088c1

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

@inproceedings{Waldvogel2007-10Bloom-12631, title={Bloom Filters: One Size Fits All?}, year={2007}, doi={10.1109/LCN.2007.17}, 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 xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:issued>2007-10</dcterms:issued> <dc:contributor>Waldvogel, Marcel</dc:contributor> <bibo:uri rdf:resource=""/> <dcterms:bibliographicCitation>First publ. in: IEEE Computer Society, 32nd IEEE Conference on Local Computer Networks, 2007, pp.183-190</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource=""/> <dc:contributor>Hurley, Paul</dc:contributor> <dcterms:available rdf:datatype="">2011-05-10T10:15:48Z</dcterms:available> <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:language>eng</dc:language> <dcterms:title>Bloom Filters: One Size Fits All?</dcterms:title> <dc:date rdf:datatype="">2011-05-10T10:15:48Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:hasPart rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Waldvogel, Marcel</dc:creator> <dcterms:rights rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dc:creator>Hurley, Paul</dc:creator> <dspace:hasBitstream rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Hurley_Waldvogel.pdf 345

This item appears in the following Collection(s)

Search KOPS


My Account