Bloom Filters: One Size Fits All?

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:556aca9a993ddf7cbecdc11854d088c1

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

@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:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/12631"> <dcterms:issued>2007-10</dcterms:issued> <dc:contributor>Waldvogel, Marcel</dc:contributor> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/12631"/> <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:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-10T10:15:48Z</dcterms:available> <dcterms:title>Bloom Filters: One Size Fits All?</dcterms:title> <dc:rights>deposit-license</dc:rights> <dc:language>eng</dc:language> <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> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-05-10T10:15:48Z</dc:date> <dc:creator>Waldvogel, Marcel</dc:creator> <dc:creator>Hurley, Paul</dc:creator> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Hurley_Waldvogel.pdf 87

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto