An Improved Construction for Counting Bloom Filters (2006)

by Flavio Bonomi , Michael Mitzenmacher , Rina Panigrahy , Sushil Singh , George Varghese
Venue:14th Annual European Symposium on Algorithms, LNCS 4168
Citations:31 - 3 self

Documents Related by Co-Citation

681 Summary cache: A scalable wide-area web cache sharing protocol – Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder - 1998
1456 Space/Time Trade-offs in Hash Coding with Allowable Errors – Burton H. Bloom - 1970
341 Network Applications of Bloom Filters: A Survey – Andrei Broder, Michael Mitzenmacher - 2002
35 An optimal Bloom filter replacement – A Pagh, R Pagh, S S Rao - 2005
31 Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006
10 Using the Power of Two Choices to Improve Bloom Filters – Steve Lumetta, Michael Mitzenmacher - 2006
193 Compressed Bloom Filters – Michael Mitzenmacher - 2001
80 Spectral bloom filters – S Cohen, Y Matias - 2003
61 The Bloomier filter: An efficient data structure for static support lookup tables – Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal - 2004
68 Using Multiple Hash Functions to Improve IP Lookups – Michael Mitzenmacher, Andrei Broder - 2000
28 Less hashing, same performance: Building a better bloom filter – Adam Kirsch, Michael Mitzenmacher - 2006
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
6 Bloom filters: design innovations and novel applications – Y Lu, B Prabhakar, F Bonomi - 2005
82 How Asymmetry Helps Load Balancing – Berthold Vöcking - 1999
29 Exact and approximate membership testers – L Carter, R Floyd, J Gill, G Markowsky, M Wegman - 1978
12 On the false-positive rate of Bloom filters – Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel Smid, Yihui Tang - 2007
33 Why simple hash functions work: Exploiting the entropy in a data stream – Michael Mitzenmacher, Salil Vadhan - 2008
154 Deep Packet Inspection Using Parallel Bloom Filters – Sarang Dharmapurikar, Praveen Krishnamurthy, Todd Sproull, John Lockwood, Line Speeds - 2004
97 Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection – Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese