Article

An improved construction for counting bloom filters

Authors:

Michael Mitzenmacher,

Rina Panigrahy,

George VargheseAuthors Info & Claims

ESA'06: Proceedings of the 14th conference on Annual European Symposium - Volume 14

Pages 684 - 695

https://doi.org/10.1007/11841036_61

Published: 11 September 2006 Publication History

Abstract

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As with a Bloom filter, a CBF obtains space savings by allowing false positives. We provide a simple hashing-based alternative based on d -left hashing called a d -left CBF (dlCBF). The dlCBF offers the same functionality as a CBF, but uses less space, generally saving a factor of two or more. We describe the construction of dlCBFs, provide an analysis, and demonstrate their effectiveness experimentally.

References

[1]

Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal of Computing 29(1):180-200, 1999.

[2]

P. Berenbrink, A. Czumaj, A. Steger, and B. Vöcking. Balanced allocations: the heavily loaded case. In <i>Proc. of the 32nd Annual ACM STOC, pp. 745-754, 2000.

[3]

B. Bloom. Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM , 13(7):422-426, 1970.

[4]

F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. Beyond Bloom filters: From approximate membership checks to approximate state machines. To appear in Proc. of SIGCOMM , 2006.

[5]

A. Broder and M. Mitzenmacher. Using multiple hash functions to improve IP Lookups. In Proceedings of IEEE INFOCOM , pp. 1454-1463, 2001.

[6]

A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics , 1(4):485-509, 2004.

[7]

S. Cohen and Y. Matias. Spectral Bloom Filters. Proceedings of the 2003 ACM SIGMOD Conference , pp. 241-252.

[8]

S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood. Deep Packet Inspection using Parallel Bloom Filters. In IEEE Hot Interconnects 12 , 2003.

[9]

S. Dharmapurikar, P. Krishnamurthy, and D. Taylor. Longest prefix matching using Bloom filters. Proceedings of the ACM SIGCOMM 2003 , pp. 201-212.

[10]

L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable widearea Web cache sharing protocol. IEEE/ACM Trans. on Networking , 8(3):281-293, 2000.

[11]

K. Kenthapadi and R. Panigrahy. Balanced allocation on graphs. In Proc. of the Seventeenth Annual ACM-SIAM Symp. on Discrete Algorithms , pp. 434-443, 2006.

[12]

Y. Lu, B. Prabhakar, and F. Bonomi. Perfect Hashing for Network Applications. To appear in Proc. of ISIT 2006 .

[13]

M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press, 2005.

[14]

M. Mitzenmacher and B. Vöcking. The asymptotics of selecting the shortest of two, improved. In Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich , edited by Y. Suhov, American Mathematical Society, 2003.

[15]

R. Pagh and F. Rodler. Cuckoo Hashing. In Proc. of the 9th Annual European Symposium on Algorithms , pp. 121-133, 2001.

[16]

R. Panigrahy. Efficient hashing with lookups in two memory accesses. In Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms , pp. 830-839, 2005.

[17]

A. Pagh, R. Pagh, and S. Rao. An Optimal Bloom Filter Replacement. In Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms , pp. 823-829, 2005.

[18]

R. Rajwar, M. Herlihy, and K. Lai. Virtualizing Transactional Memory. In Proc. of the 32nd Annual Int'l Symp. on Computer Architecture , pp. 494-505, 2005.

[19]

M. Sharma and J. Byers. Scalable Coordination Techniques for Distributed Network Monitoring. 6th International Workshop on Passive and Active Network Measurement (PAM) , pp. 349-352, 2005.

[20]

B. Vöcking. How asymmetry helps load balancing. In Proceedings of the 40 th IEEE-FOCS , pp. 131-140, 1999.

Cited By

Wen RMcCoy HTench DTagliavini GBender MConway AFarach-Colton MJohnson RPandey P(2024)Adaptive Quotient FiltersProceedings of the ACM on Management of Data10.1145/36771282:4(1-28)Online publication date: 30-Sep-2024
https://dl.acm.org/doi/10.1145/3677128
Celi SDavidson ALuo BLiao XXu JKirda ELie D(2024)Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword QueriesProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670271(4107-4121)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670271
Wang HDai HGu RLu YZheng JDai JChen SChen ZLi SChen G(2024)Wormhole Filters: Caching Your Hash on Persistent MemoryProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629590(456-471)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629590
Show More Cited By

Index Terms

An improved construction for counting bloom filters
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Combinatorial algorithms
      2. Enumeration
  2. Mathematical analysis
    1. Numerical analysis
      1. Computations in finite fields
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

False Negative Problem of Counting Bloom Filter

Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often believe that it is possible that a Bloom filter returns a false positive, but ...
Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives
CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference

Where distributed agents must share voluminous set membership information, Bloom filters provide a compact, though lossy, way for them to do so. Numerous recent networking papers have examined the trade-offs between the bandwidth consumed by the ...
The Dynamic Bloom Filters

A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter and its variants just focus on how to represent a static set and decrease the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA'06: Proceedings of the 14th conference on Annual European Symposium - Volume 14

September 2006

840 pages

ISBN:3540388753

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 September 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

86
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wen RMcCoy HTench DTagliavini GBender MConway AFarach-Colton MJohnson RPandey P(2024)Adaptive Quotient FiltersProceedings of the ACM on Management of Data10.1145/36771282:4(1-28)Online publication date: 30-Sep-2024
https://dl.acm.org/doi/10.1145/3677128
Celi SDavidson ALuo BLiao XXu JKirda ELie D(2024)Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword QueriesProceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security10.1145/3658644.3670271(4107-4121)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3658644.3670271
Wang HDai HGu RLu YZheng JDai JChen SChen ZLi SChen G(2024)Wormhole Filters: Caching Your Hash on Persistent MemoryProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3629590(456-471)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3629590
Pandey PFarach-Colton MDayan NZhang HBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Beyond Bloom: A Tutorial on Future Feature-Rich FiltersCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654681(636-644)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654681
Lian WWang JYou J(2024)Flexible fingerprint cuckoo filter for information retrieval optimization in distributed networkDistributed and Parallel Databases10.1007/s10619-024-07440-w42:3(377-401)Online publication date: 11-Apr-2024
https://dl.acm.org/doi/10.1007/s10619-024-07440-w
Liu CChoi WKhadirsharbiyani SKandemir MMohror KArnold DBadia R(2023)MBFGraph: An SSD-based External Graph System for Evolving GraphsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607070(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607070
Fernandes PBaquero CGonzalez Boix ESutra P(2023)Probabilistic Causal Contexts for Scalable CRDTsProceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3578358.3591331(1-8)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3578358.3591331
McCoy HHofmeyr SYelick KPandey PDehnavi MKulkarni MKrishnamoorthy S(2023)High-Performance Filters for GPUsProceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming10.1145/3572848.3577507(160-173)Online publication date: 25-Feb-2023
https://dl.acm.org/doi/10.1145/3572848.3577507
Almeida P(2023)A Case for Partitioned Bloom FiltersIEEE Transactions on Computers10.1109/TC.2022.321899572:6(1681-1691)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1109/TC.2022.3218995
Cheng XLuo LZou WYang XGuo D(2023)Popularity Cuckoo Filter: Always Keeping Popular Items in MindAlgorithms and Architectures for Parallel Processing10.1007/978-981-97-0808-6_25(428-445)Online publication date: 20-Oct-2023
https://dl.acm.org/doi/10.1007/978-981-97-0808-6_25
Show More Cited By

View Options

View options

Figures

Tables

Media

View Table of Conten