Less hashing, same performance: Building a better bloom filter

Random Structures and Algorithms

Volumn 33, Issue 2, 2008, Pages 187-218

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Bloom filters; Double hashing; Poisson convergence

Indexed keywords

EID: 52349121903     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20208     Document Type: Article

References (25)

1. P. Billingsley, Probability and measure, 3rd edition, Wiley, New York, 1995.
2. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, Beyond Bloom filters: From approximate membership checks to approximate state machines, Proc 2006 ACM SIGCOMM, 2006, pp. 315-326.
3. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, Bloom filters via d-left hashing and dynamic bit reassignment, Proc Allerton Conf Communication, Control and Computing, 2006, pp. 877-883.
4. A. Broder and M. Mitzenmacher, Network applications of Bloom filters: A survey, Internet Math 1 (2004), 485-509.
5. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, The Bloomier filter: An efficient data structure for static support lookup tables, Proc 15th ACM/SIAM Symp Discrete Algorithms (SODA), 2004, pp. 30-39.
6. G. Cormode and S. Muthukrishnan, Improved data stream summaries: The Count-Min sketch and its applications, DIMACS Technical Report 2003-20, 2003.
7. H. Cramer, Random variables and probability distributions, 3rd edition, Cambridge University Press, Cambridge, 1970.
8. P. C. Dillinger and P. Manolios, Fast and accurate bitstate verification for SPIN, Proc 11th Int SPIN Workshop, 2004, pp. 57-75.
9. P. C. Dillinger and P. Manolios, Bloom filters in probabilistic verification, Proc 5th Int Conf FMCAD, 2004, pp. 367-381.
10. B. Donnet, B. Baynat, and T. Friedman, Retouched Bloom filters: Allowing networked applications to flexibly trade off false positives against false negatives, arxiv, cs.NI/0607038, 2006.
11. D. P. Dubhashi and D. Ranjan, Balls and bins: A case study in negative dependence, Random Structures Algorithms 13 (1998), 99-124.
12. C. Estan and G. Varghese, New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice, ACM Trans Comput Syst 21 (2003), 270-313.
13. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, Summary cache: A scalable wide-area Web cache sharing protocol, IEEE/ACM Trans Netw 8 (2000), 281-293.
14. G. Grimmett and D. Stirzaker, Probability and random processes, 3rd edition, Oxford University Press, Oxford, UK, 2001.
15. K. Ireland and M. Rosen, A classical introduction to modern number theory, 2nd edition, Springer-Verlag, New York, NY, 1990.
16. A. Kirsch and M. Mitzenmacher, Building a better Bloom filter, Proc 14th ESA, 2006, pp. 456-467.
17. A. Kirsch and M. Mitzenmacher, Building a better Bloom filter, Harvard University Computer Science Technical Report TR-02-05, 2005, Available at: ftp://ftp.deas.harvard.edu/techreports/tr-02-05.pdf.
18. D. Knuth, The art of computer programming, vol. 3, sorting and searching, Addison-Wesley, Reading, MA, 1973.
19. G. Lueker and M. Molodowitch, More analysis of double hashing, Proc 20th ACM STOC, 1988, pp. 354-359.
20. M. Mitzenmacher, Compressed Bloom filters, IEEE/ACM Trans Netw 10 (2002), 613-620.
21. M. Mitzenmacher and E. Upfal, Probability and computing: Randomized algorithms and probabilistic analysis, Cambridge University Press, Cambridge, 2005.
22. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, Cambridge, 1995.
23. A. Pagh, R. Pagh, and S. S. Rao, An optimal Bloom filter replacement, Proc 16th ACM-SIAM SODA, 2005, pp. 823-829.
24. M. V. Ramakrishna, Practical performance of Bloom filters and parallel free-text searching, Commun ACM 32 (1989), 1237-1239.
25. J. P. Schmidt and A. Siegel, The analysis of closed hashing under limited randomness, Proc 22nd ACM STOC, 1990, pp. 224-234.