On the false-positive rate of Bloom filters

Information Processing Letters

Volumn 108, Issue 4, 2008, Pages 210-213

  Bose, Prosenjit ^a   Guo, Hua ^a   Kranakis, Evangelos ^a   Maheshwari, Anil ^a   Morin, Pat ^a   Morrison, Jason ^a   Smid, Michiel ^a   Tang, Yihui ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Analysis of algorithms; Data structures

Indexed keywords

DATA STRUCTURES; FILE ORGANIZATION; RISK ASSESSMENT; TURBULENT FLOW; WAVE FILTERS;

ANALYSIS OF ALGORITHMS; BLOOM FILTERING; FALSE POSITIVES; MEMBERSHIP QUERIES; POSITIVE RATES;

BLOOMS (METAL);

EID: 52049099367     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.05.018     Document Type: Article

References (13)

1. S.M. Bellovin, W.R. Cheswick, Privacy-enhanced searches using encrypted Bloom filters, Draft, 2004, http://www.research.att.com/~smb/papers/bloom-encrypt.ps
2. Bloom B.H. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13 7 (1970) 422-426
3. A. Broder, M. Mitzenmacher, Network applications of Bloom filters: A survey, in: Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing, 2002, pp. 636-646
4. L. Carter, R. Floyd, J. Gill, G. Markowsky, M. Wegman, Exact and approximate membership testers, in: Annual ACM Symposium on Theory of Computing, 1978, pp. 59-65
5. E.-J. Goh, Secure indexes for efficient searching on encrypted compressed data, Technical Report 2003/216, Cryptology ePrint Archive, 2003. http://eprint.iacr.org/2003/216/
6. Graham R.L., Knuth D.E., and Patashnik O. Concrete Mathematics. second ed. (1994), Addison-Wesley
7. Gremillion L.L. Designing a Bloom filter for differential access. Communications of the ACM 25 7 (1982) 600-604
8. A. Kamath, R. Motwani, K. Palem, P. Spirakis, Tail bounds for occupancy and the satisfiability threshold conjecture, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 592-603
9. J. Schachter M. Ceglowski, Loaf, Online at http://loaf.cantbedone.org/
10. Mitzenmacher M. Compressed Bloom filters. IEEE/ACM Transactions on Networks 10 5 (2002)
11. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
12. Mullin J.K. A second look at Bloom filters. Communications of the ACM 26 8 (1983)
13. Ramakrishna M.V. Practical performance of Bloom filters and parallel free-text searching. Communications of the ACM 25 7 (1982) 600-604