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,739 | InfiniFilter: Expanding Filters to Infinity and Beyond | 2023 | SIGMOD | 5.3471718e-05 |
| 5,863 | GRF: A Global Range Filter for LSM-Trees with Shape Encoding | 2024 | SIGMOD | 5.2979639e-05 |
| 8,525 | Aleph Filter: To Infinity in Constant Time | 2024 | VLDB | 4.4937074e-05 |
| 9,386 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 4.3455975e-05 |
| 10,145 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD | 4.1945683e-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.00078672446 |
| 379 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.0002493527 |
| 569 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00019924098 |
| 609 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.0001923446 |
| 1,248 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.00013046661 |
| 1,311 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD | 0.00012657439 |
| 1,366 | SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data | 2017 | VLDB | 0.00012357685 |
| 2,471 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7320072e-05 |
| 2,798 | Chucky: A Succinct Cuckoo Filter for LSM-Tree | 2021 | SIGMOD | 8.1080111e-05 |
| 5,516 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 5.4628856e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,516 | Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design | 2021 | SIGMOD | 5.4628856e-05 |
| 8,502 | Conditional Cuckoo Filters | 2021 | SIGMOD | 4.4972336e-05 |
| 2,843 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD | 8.0257314e-05 |
| 4,994 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB | 5.78027e-05 |
| 8,178 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB | 4.5672537e-05 |
| 781 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016741046 |
| 2,471 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7320072e-05 |
| 10,145 | Breadcrumb Filters: Fast Fully Featured Filters | 2026 | SIGMOD | 4.1945683e-05 |
| 4,158 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB | 6.3994318e-05 |
| 9,842 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB | 4.2722447e-05 |