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 (Harvard University)
- 2. Brian Hentschel (Harvard University)
- 3. Stratos Idreos (Harvard University)
BibTeX Citation
@article{deeds_vldb21,
title = {{Stacked Filters: Learning to Filter by Structure}},
author = {Deeds, Kyle and Hentschel, Brian and Idreos, Stratos},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {4},
pages = {600--612},
doi = {10.14778/3436905.3436919},
url = {https://doi.org/10.14778/3436905.3436919},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,980 | Chucky: A Succinct Cuckoo Filter for LSM-Tree | 2021 | SIGMOD | 9.2595896e-05 |
| 4,197 | Proteus: A Self-Designing Range Filter | 2022 | SIGMOD | 6.7417716e-05 |
| 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,358 | Optimizing Collections of Bloom Filters within a Space Budget | 2024 | VLDB | 5.5431911e-05 |
| 7,940 | Aleph Filter: To Infinity in Constant Time | 2024 | VLDB | 5.4219572e-05 |
| 9,003 | Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity | 2022 | SIGMOD | 5.2392472e-05 |
| 9,051 | Adaptive Quotient Filters | 2024 | SIGMOD | 5.2304894e-05 |
| 9,643 | Hourglass: An Adaptive Range Filter with Lightweight Hybrid Encoding | 2026 | SIGMOD | 5.1453267e-05 |
| 11,863 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD | 4.9793485e-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 |
|---|---|---|---|---|
| 40 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00046284649 |
| 400 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD | 0.00019129175 |
| 789 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.0001397781 |
| 1,844 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB | 9.5159229e-05 |
| 2,071 | A General-Purpose Counting Filter: Making Every Bit Count | 2017 | SIGMOD | 9.0866982e-05 |
| 3,285 | Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput | 2019 | VLDB | 7.4559907e-05 |
| 3,547 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD | 7.2121974e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,051 | Adaptive Quotient Filters | 2024 | SIGMOD |
| 2 | 870 | Spectral Bloom Filters | 2003 | SIGMOD |
| 3 | 3,547 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD |
| 4 | 11,881 | New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters | 2022 | VLDB |
| 5 | 8,019 | LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead | 2023 | SIGMOD |
| 6 | 11,863 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD |
| 7 | 6,192 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB |
| 8 | 10,441 | Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters | 2026 | SIGMOD |
| 9 | 11,737 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD |
| 10 | 3,703 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB |