countBF: A General-purpose High Accuracy and Space Efficient Counting Bloom Filter
Sabuzima Nayak, Ripon Patgiri

TL;DR
countBF is a novel counting Bloom Filter that significantly reduces memory usage while maintaining high accuracy and low false positive rates, outperforming existing Bloom Filter variants.
Contribution
The paper introduces countBF, a new counting Bloom Filter based on SBF and 2D Bloom Filter, with improved memory efficiency and accuracy.
Findings
Uses 1.96x less memory than SBF
Uses 7.85x less memory than CBF
Achieves 99.999921% accuracy
Abstract
Bloom Filter is a probabilistic data structure for the membership query, and it has been intensely experimented in various fields to reduce memory consumption and enhance a system's performance. Bloom Filter is classified into two key categories: counting Bloom Filter (CBF), and non-counting Bloom Filter. CBF has a higher false positive probability than standard Bloom Filter (SBF), i.e., CBF uses a higher memory footprint than SBF. But CBF can address the issue of the false negative probability. Notably, SBF is also false negative free, but it cannot support delete operations like CBF. To address these issues, we present a novel counting Bloom Filter based on SBF and 2D Bloom Filter, called countBF. countBF uses a modified murmur hash function to enhance its various requirements, which is experimentally evaluated. Our experimental results show that countBF uses and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCaching and Content Delivery · Covalent Organic Framework Applications · Cooperative Communication and Network Coding
