Adaptive Cuckoo Filters

DOI10.1145/3339504MaRDI QIDQ6039930zbMATH OpenOpenAlexFDO

Authors Michael Mitzenmacher, Salvatore Pontarelli, Pedro Reviriego

Publication date 23 May 2023

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3339504

zbMATH Keywords

adaptiveBloom filterscuckoo hashingfalse positive rateMarkov chains

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Adaptive cuckoo filters
• Cuckoo filter: simplification and analysis
• Xor Filters
• Cache-, hash-, and space-efficient bloom filters
• Network Applications of Bloom Filters: A Survey

Cites work

• Balanced allocation and dictionaries with tightly packed constant size bins
• Cuckoo hashing
• scientific article; zbMATH DE number 5764819 (Why is no real title available?)
• scientific article; zbMATH DE number 6469129 (Why is no real title available?)
• More robust hashing: cuckoo hashing with a stash
• Network Applications of Bloom Filters: A Survey
• Optimizing data popularity conscious Bloom filters
• Parallel d-Pipeline: A Cuckoo Hashing Implementation for Increased Throughput
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Space efficient hash tables with worst case constant access time
• Space/time trade-offs in hash coding with allowable errors

Cited in

(3)

• CuCoTrack: cuckoo filter based connection tracking
• Adaptive cuckoo filters
• Cuckoo filter: simplification and analysis

This page was built for publication: Adaptive Cuckoo Filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039930)