Relaxed concurrent counting bloom filters

dc.contributor.author	Mishra, Dhruv
dc.contributor.author	Bajaj, Kshitij
dc.contributor.author	Chatterjee, Bapi (Advisor)
dc.date.accessioned	2024-05-24T11:26:17Z
dc.date.available	2024-05-24T11:26:17Z
dc.date.issued	2023-11-29
dc.identifier.uri	http://repository.iiitd.edu.in/xmlui/handle/123456789/1613
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	IIIT-Delhi	en_US
dc.subject	Bloom Filters	en_US
dc.subject	Probability of False Positives	en_US
dc.subject	Approximate Counters and Relaxed Counters	en_US
dc.subject	Throughput and Scalability Testing	en_US
dc.title	Relaxed concurrent counting bloom filters	en_US
dc.type	Other	en_US