A new analysis of the false positive rate of a Bloom filter

DOI10.1016/j.ipl.2010.07.024zbMath1379.68103OpenAlexW2043012581MaRDI QIDQ1675763

Ken Christensen, Miguel Jimeno, Allen Roginsky

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.024

zbMATH Keywords

analysis of algorithmsdata structuresBloom filters

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (2)

On the analysis of Bloom filters ⋮ Supporting early pruning in top-\(k\) query processing on massive data

Uses Software

• Bigtable

Cites Work

• On the false-positive rate of Bloom filters
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: A new analysis of the false positive rate of a Bloom filter