On the false-positive rate of Bloom filters
Authors:
- Prosenjit BosePBProsenjit Bose
- Hua GuoHGHua Guo
- Evangelos KranakisEvangelos Kranakis
- Anil MaheshwariAMAnil Maheshwari
- Pat MorinPMPat Morin
- Jason MorrisonJMJason Morrison
- Michiel SmidMSMichiel Smid
- Yihui TangYTYihui Tang
- 1 October 2008
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 108 (4) , 210-213
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Tail bounds for occupancy and the satisfiability threshold conjecture2002
- Compressed Bloom filtersIEEE/ACM Transactions on Networking, 2002
- A second look at bloom filtersCommunications of the ACM, 1983
- Designing a Bloom filter for differential file accessCommunications of the ACM, 1982
- Exact and approximate membership testers1978
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970