Prefix Filter: Practically and Theoretically Better Than Bloom
Summary: Prefix Filter: an incremental, insert-only filter that matches dynamic-filter space with fast inserts and high query throughput. Analysis bounds false positives and cache costs, with 1.39–1.46x build-time gains over vector quotient and 3.2–3.5x over cuckoo for large n. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tomer Even
- 2. Guy Even
- 3. Adam Morrison
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,749 | InfiniFilter: Expanding Filters to Infinity and Beyond | 2023 | SIGMOD | 5.3420354e-05 |
| 5,868 | GRF: A Global Range Filter for LSM-Trees with Shape Encoding | 2024 | SIGMOD | 5.2928769e-05 |
| 8,524 | Aleph Filter: To Infinity in Constant Time | 2024 | VLDB | 4.4893996e-05 |
| 9,390 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 4.341433e-05 |
| 10,145 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD | 4.1905499e-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 |
|---|---|---|---|---|
| 30 | Hashing Methods and Relational Algebra Operations | 1984 | VLDB | 0.00078665259 |
| 379 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00024954332 |
| 568 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00019932335 |
| 608 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.00019233548 |
| 1,249 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.00013040265 |
| 1,309 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD | 0.00012655712 |
| 1,368 | SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data | 2017 | VLDB | 0.0001235708 |
| 2,469 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7255912e-05 |
| 2,797 | Chucky: A Succinct Cuckoo Filter for LSM-Tree | 2021 | SIGMOD | 8.1116755e-05 |
| 5,519 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 5.4682661e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,519 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 5.4682661e-05 |
| 4,993 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB | 5.7749409e-05 |
| 2,848 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD | 8.0202739e-05 |
| 8,499 | Conditional Cuckoo Filters | 2021 | SIGMOD | 4.4929219e-05 |
| 8,179 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB | 4.5628742e-05 |
| 778 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016729191 |
| 2,469 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7255912e-05 |
| 10,145 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD | 4.1905499e-05 |
| 4,157 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB | 6.3935343e-05 |
| 9,842 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB | 4.2681507e-05 |