ChainedFilter: Combining Membership Filters by Chain Rule
Summary: Unified theory for membership via chain rule, bridging approximate and exact solutions. ChainedFilter combines elementary filters without information loss, improving performance in dictionaries, compression, Cuckoo hashing, and learned filters. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Haoyu Li (Peking University; University of Texas)
- 2. Liuhui Wang (University of Pennsylvania)
- 3. Qizhi Chen (Peking University)
- 4. Jianan Ji (Peking University)
- 5. Yuhan Wu (Peking University)
- 6. Yikai Zhao (Peking University)
- 7. Tong Yang (Peking University)
- 8. Aditya Akella (University of Texas)
BibTeX Citation
@inproceedings{li_sigmod23,
title = {{ChainedFilter: Combining Membership Filters by Chain Rule}},
author = {Li, Haoyu and Wang, Liuhui and Chen, Qizhi and Ji, Jianan and Wu, Yuhan and Zhao, Yikai and Yang, Tong and Akella, Aditya},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3626721},
url = {https://dl.acm.org/doi/10.1145/3626721},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,457 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD | 5.2642945e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 43 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00046060254 |
| 1,213 | MyRocks: LSM-Tree Database Storage Engine Serving Facebook's Social Graph | 2020 | VLDB | 0.00011646797 |
| 4,073 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB | 6.9242783e-05 |
| 7,498 | Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation | 2022 | VLDB | 5.6031077e-05 |
| 7,860 | LadderFilter: Filtering Infrequent Items with Small Memory and Time Overhead | 2023 | SIGMOD | 5.5302333e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,971 | Persistent Bloom Filter: Membership Testing for the Entire History | 2018 | SIGMOD |
| 2 | 10,225 | Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters | 2026 | SIGMOD |
| 3 | 8,612 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD |
| 4 | 1,975 | Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity | 2018 | VLDB |
| 5 | 4,073 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB |
| 6 | 6,539 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB |
| 7 | 3,442 | An Efficient Filter for Approximate Membership Checking | 2008 | SIGMOD |
| 8 | 11,423 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD |
| 9 | 4,532 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 10 | 8,413 | Conditional Cuckoo Filters | 2021 | SIGMOD |