LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead
Summary: Filters infrequent items in data streams with memory-friendly multi-LRU queues and SIMD-based LRU to cut time overhead. Applied to four sketch types, LadderFilter yields up to 60.6× accuracy and 1.37× throughput while keeping memory low; open-source. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuanpeng Li (Peking University; Peng Cheng Laboratory)
- 2. Feiyu Wang (Peking University)
- 3. Xiang Yu (Peking University)
- 4. Yilong Yang (Xidian University)
- 5. Kaicheng Yang (Peking University)
- 6. Tong Yang (Peking University; Peng Cheng Laboratory)
- 7. Zhuo Ma (Xidian University)
- 8. Bin Cui (Peking University)
- 9. Steve Uhlig (Queen Mary University of London)
BibTeX Citation
@inproceedings{li_sigmod23,
title = {{LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead}},
author = {Li, Yuanpeng and Wang, Feiyu and Yu, Xiang and Yang, Yilong and Yang, Kaicheng and Yang, Tong and Ma, Zhuo and Cui, Bin and Uhlig, Steve},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3588690},
url = {https://dl.acm.org/doi/10.1145/3588690},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,083 | ChainedFilter: Combining Membership Filters by Chain Rule | 2023 | SIGMOD | 5.1578347e-05 |
| 10,329 | SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation | 2026 | SIGMOD | 5.093636e-05 |
| 10,673 | Pandora: An Efficient and Rapid Solution for Persistence-Based Tasks in High-Speed Data Streams | 2025 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00031260115 |
| 1,294 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD | 0.00011291308 |
| 1,905 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD | 9.5034849e-05 |
| 2,878 | Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation | 2018 | SIGMOD | 8.0058242e-05 |
| 3,898 | BurstSketch: Finding Bursts in Data Streams | 2021 | SIGMOD | 7.0367583e-05 |
| 4,863 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 6.4740702e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,533 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD |
| 2 | 6,416 | Memento Filter: A Fast, Dynamic, and Robust Range Filter | 2024 | SIGMOD |
| 3 | 10,329 | SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation | 2026 | SIGMOD |
| 4 | 4,073 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB |
| 5 | 4,863 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB |
| 6 | 1,294 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD |
| 7 | 11,554 | Workload-Adaptive Filtering in Storage Engines | 2022 | SIGMOD |
| 8 | 11,423 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD |
| 9 | 1,905 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD |
| 10 | 4,532 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |