Prefix Filter: Practically and Theoretically Better Than Bloom
Summary: Introduces Prefix Filter, an incremental AMQ structure combining dynamic-filter space efficiency with Bloom-like simplicity and consistently fast queries/inserts. Rigorous practical-size analysis covers failure, false positives, and cache-line accesses; builds 1.39–3.5× faster than competitors. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tomer Even (Tel Aviv University)
- 2. Guy Even (Tel Aviv University)
- 3. Adam Morrison (Tel Aviv University)
BibTeX Citation
@article{even_vldb22,
title = {{Prefix Filter: Practically and Theoretically Better Than Bloom}},
author = {Even, Tomer and Even, Guy and Morrison, Adam},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {7},
pages = {1311--1323},
doi = {10.14778/3523210.3523211},
url = {https://doi.org/10.14778/3523210.3523211},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,750 | GRF: A Global Range Filter for LSM-Trees with Shape Encoding | 2024 | SIGMOD | 6.4354422e-05 |
| 5,081 | InfiniFilter: Expanding Filters to Infinity and Beyond | 2023 | SIGMOD | 6.2854372e-05 |
| 7,940 | Aleph Filter: To Infinity in Constant Time | 2024 | VLDB | 5.4219572e-05 |
| 9,130 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 5.2233025e-05 |
| 10,623 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD | 4.9793485e-05 |
| 10,777 | Succinct and Fast Tiny Pointer Hash Tables | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 82 | Hashing Methods and Relational Algebra Operations | 1984 | VLDB | 0.00036053776 |
| 258 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00022939599 |
| 400 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.00019129175 |
| 436 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00018319035 |
| 754 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD | 0.00014236015 |
| 789 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.0001397781 |
| 816 | SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data | 2017 | VLDB | 0.00013687311 |
| 1,844 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 9.5159229e-05 |
| 1,980 | Chucky: A Succinct Cuckoo Filter for LSM-Tree | 2021 | SIGMOD | 9.2595896e-05 |
| 3,712 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 7.078249e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,625 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 2 | 8,580 | Conditional Cuckoo Filters | 2021 | SIGMOD |
| 3 | 2,071 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD |
| 4 | 6,936 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB |
| 5 | 870 | Spectral Bloom Filters | 2003 | SIGMOD |
| 6 | 10,441 | Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters | 2026 | SIGMOD |
| 7 | 1,844 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB |
| 8 | 10,623 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD |
| 9 | 3,285 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB |
| 10 | 10,142 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB |