A Shifting Bloom Filter Framework for Set Queries
Summary: Introduces Shifting Bloom Filters (ShBF), encoding per-element auxiliary information as location offsets rather than extra memory. Supports membership, association, and multiplicity queries, outperforming prior Bloom-filter structures on network-trace workloads. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tong Yang (Beijing Institute of Technology; Peking University)
- 2. Alex X. Liu (Michigan State University)
- 3. Muhammad Shahzad (North Carolina State University)
- 4. Yuankun Zhong (Nanjing University)
- 5. Qiaobin Fu (Boston University)
- 6. Zi Li (Nanjing University)
- 7. Gaogang Xie (Institute of Computing Technology, Chinese Academy of Sciences)
- 8. Xiaoming Li (Peking University)
BibTeX Citation
@article{yang_vldb16,
title = {{A Shifting Bloom Filter Framework for Set Queries}},
author = {Yang, Tong and Liu, Alex X. and Shahzad, Muhammad and Zhong, Yuankun and Fu, Qiaobin and Li, Zi and Xie, Gaogang and Li, Xiaoming},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {5},
pages = {408--419},
doi = {10.14778/2876473.2876476},
url = {https://doi.org/10.14778/2876473.2876476},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,905 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD | 9.5034849e-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 |
| 8,612 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD | 5.4012878e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 862 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00013532857 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,126 | Adaptive Range Filters for Cold Data: Avoiding Trips to Siberia | 2013 | VLDB |
| 2 | 7,469 | Optimizing Collections of Bloom Filters within a Space Budget | 2024 | VLDB |
| 3 | 10,937 | Authenticated Aggregate Queries with Boolean Range Predicates on Blockchains | 2025 | VLDB |
| 4 | 3,533 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD |
| 5 | 4,532 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB |
| 6 | 6,539 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB |
| 7 | 4,971 | Persistent Bloom Filter: Membership Testing for the Entire History | 2018 | SIGMOD |
| 8 | 8,612 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD |
| 9 | 4,073 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB |
| 10 | 862 | Spectral Bloom Filters | 2003 | SIGMOD |