Stacked Filters: Learning to Filter by Structure
Summary: Stacked Filters blend workload knowledge of negatives into a hashed filter stack for fast filtering. Adaptive, they learn on the fly and outperform query-agnostic and classifier-based filters in end-to-end throughput, up to 130x within memory. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kyle Deeds
- 2. Brian Hentschel
- 3. Stratos Idreos
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,798 | Chucky: A Succinct Cuckoo Filter for LSM-Tree | 2021 | SIGMOD | 8.1080111e-05 |
| 4,835 | Proteus: A Self-Designing Range Filter | 2022 | SIGMOD | 5.8905445e-05 |
| 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 |
| 7,663 | Optimizing Collections of Bloom Filters within a Space Budget | 2024 | VLDB | 4.6857816e-05 |
| 8,525 | Aleph Filter: To Infinity in Constant Time | 2024 | VLDB | 4.4937074e-05 |
| 8,720 | Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity | 2022 | SIGMOD | 4.4609699e-05 |
| 8,957 | Adaptive Quotient Filters | 2024 | SIGMOD | 4.4211093e-05 |
| 10,021 | Hourglass: An Adaptive Range Filter with Lightweight Hybrid Encoding | 2026 | SIGMOD | 4.1945683e-05 |
| 11,356 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 102 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00049545203 |
| 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 |
| 2,471 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 8.7320072e-05 |
| 2,843 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD | 8.0257314e-05 |
| 3,838 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD | 6.7134945e-05 |
| 4,158 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB | 6.3994318e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,957 | Adaptive Quotient Filters | 2024 | SIGMOD | 4.4211093e-05 |
| 9,842 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB | 4.2722447e-05 |
| 781 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016741046 |
| 3,838 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD | 6.7134945e-05 |
| 11,374 | New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters | 2022 | VLDB | 4.1945683e-05 |
| 7,870 | LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead | 2023 | SIGMOD | 4.6308128e-05 |
| 11,356 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD | 4.1945683e-05 |
| 6,831 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB | 4.9130458e-05 |
| 11,222 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD | 4.1945683e-05 |
| 4,446 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB | 6.1800659e-05 |