IIIT-Delhi Institutional Repository
Relaxed concurrent counting bloom filters
Login
Home
→
Mathematics
→
BTech Projects
→
Year-2023
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Relaxed concurrent counting bloom filters
Mishra, Dhruv
;
Bajaj, Kshitij
;
Chatterjee, Bapi (Advisor)
URI:
http://repository.iiitd.edu.in/xmlui/handle/123456789/1613
Date:
2023-11-29
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.
Show full item record
Files in this item
Name:
Relaxed Concurrent ...
Size:
1006.Kb
Format:
PDF
This item appears in the following Collection(s)
Year-2023
[29]
Year-2023
Search Repository
Search Repository
This Collection
Advanced Search
Browse
All of Repository
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
Register