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
- abseil / Performance Hintsabseil.io
- Bloom Filterssamwho.dev
- Bloom filters debunked: Dispelling 30 Years of bad math with Coq!kirancodes.me
- Bloom filter | Docsredis.io
- Build Your Own Databasenan.fyi
- celestia-app/specs/src/vacuum.md at e666c7d38940ef32c475d8347eee301fa91fe327 · celestiaorg/celestia-app · GitHubgithub.com
- A very concrete explanation of how a cache worksparksb.github.io
- 2020 年秋季 進階電腦系統理論與實作課程作業 —— dict - HackMDhackmd.io
- abseil / Performance Hintsabseil.io
- Static search trees: 40x faster than binary search · CuriousCodingcuriouscoding.nl
- lfu.pdfdhruvbird.com