DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
http://repository.iiitd.edu.in/xmlui/handle/123456789/1613| Title: | Relaxed concurrent counting bloom filters |
| Authors: | Mishra, Dhruv Bajaj, Kshitij Chatterjee, Bapi (Advisor) |
| Keywords: | Bloom Filters Probability of False Positives Approximate Counters and Relaxed Counters Throughput and Scalability Testing |
| Issue Date: | 29-Nov-2023 |
| Publisher: | IIIT-Delhi |
| 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. |
| URI: | http://repository.iiitd.edu.in/xmlui/handle/123456789/1613 |
| Appears in Collections: | Year-2023 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Relaxed Concurrent Counting Bloom Filters - Dhruv Mishra.pdf Restricted Access | 1.01 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.