On the false-positive rate of Bloom filters

On the false-positive rate of Bloom filters

Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom's analysis has appeare...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2008-10, Vol.108 (4), p.210-213
Hauptverfasser: Bose, Prosenjit, Guo, Hua, Kranakis, Evangelos, Maheshwari, Anil, Morin, Pat, Morrison, Jason, Smid, Michiel, Tang, Yihui
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Analysis of algorithms
Applied sciences
Computer science
control theory
systems
Data processing. List processing. Character string processing
Data structures
Exact sciences and technology
Information processing
Information retrieval
Memory organisation. Data processing
Miscellaneous
Software
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom analyzed the probability of such erroneous answers, called the false-positive rate, and Bloom's analysis has appeared in many publications throughout the years. We show that Bloom's analysis is incorrect and give a correct analysis.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2008.05.018