Mishra, Dhruv; Bajaj, Kshitij; Chatterjee, Bapi (Advisor)
(IIIT-Delhi, 2023-11-29)
Counting Bloom filters are highly space-efficient with a small probability of false positives. Concurrent access to a Counting bloom filter can greatly increase its insertion and query throughput.