1. DSpace at IIIT-Delhi
  2. Mathematics
  3. BTech Projects
  4. Year-2023
Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/1613
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMishra, Dhruv-
dc.contributor.authorBajaj, Kshitij-
dc.contributor.authorChatterjee, Bapi (Advisor)-
dc.date.accessioned2024-05-24T11:26:17Z-
dc.date.available2024-05-24T11:26:17Z-
dc.date.issued2023-11-29-
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/1613-
dc.description.abstractCounting 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.isoen_USen_US
dc.publisherIIIT-Delhien_US
dc.subjectBloom Filtersen_US
dc.subjectProbability of False Positivesen_US
dc.subjectApproximate Counters and Relaxed Countersen_US
dc.subjectThroughput and Scalability Testingen_US
dc.titleRelaxed concurrent counting bloom filtersen_US
dc.typeOtheren_US
Appears in Collections:Year-2023

Files in This Item:
File Description SizeFormat 
Relaxed Concurrent Counting Bloom Filters - Dhruv Mishra.pdf
  Restricted Access		1.01 MBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.