p197-wang.pdf
vldb.org · 5,307 words · saved by 1 readers
N/A
Vacuum Filters: More Space-Efficient and Faster Replacement for Bloom and Cuckoo Filters Minmei Wang† , Mingxun Zhou‡ , Shouqian Shi† , and Chen Qian† ∗ mwang107@ucsc.edu, zhoumingxun@pku.edu.cn, sshi27@ucsc.edu and cqian12@ucsc.edu † University of California, Santa Cruz, USA ‡ Peking University, China. ABSTRACT We present vacuum filters, a type of data structures to sup- 30 port approximate membership queries. Vacuum filters cost…
saved by
related reading
- Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyterboyter.org
- [2205.14135] FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenessarxiv.org
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- Chain Replication for Supporting High Throughput and Availabilitycs.cornell.edu
- lfu.pdfdhruvbird.com
- Bloom filters debunked: Dispelling 30 Years of bad math with Coq!kirancodes.me
- [2604.25681] SimdQuickHeap: The QuickHeap Reconsideredarxiv.org
- Paged Attention from First Principles: A View Inside vLLM – Hamza's Bloghamzaelshafie.bearblog.dev
- homepages.cwi.nl/~boncz/lsde/papers/p215-dageville-snowflake.pdfhomepages.cwi.nl
- Garbage Collection Techniquescs.cmu.edu
- Probabilistic Data Structures and LLMsmatt-rickard.com
- Static B-Trees - Algorithmicaen.algorithmica.org