Persistent Bloom Filter: Membership Testing for the Entire History
Summary: Introduces persistent Bloom Filter (PBF) for temporal membership testing across history. Unlike standard Bloom Filters that scale poorly for temporal queries, PBF encodes presence over time in compact space to support fast history-wide membership tests. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yanqing Peng
- 2. Jinwei Guo
- 3. Feifei Li
- 4. Weining Qian
- 5. Aoying Zhou
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,544 | Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores | 2020 | SIGMOD | 6.9898874e-05 |
| 3,751 | BurstSketch: Finding Bursts in Data Streams | 2021 | SIGMOD | 6.7888099e-05 |
| 5,909 | At-the-time and Back-in-time Persistent Sketches | 2021 | SIGMOD | 5.2769377e-05 |
| 6,593 | Out of Many We are One: Measuring Item Batch with Clock-Sketch | 2021 | SIGMOD | 4.9999287e-05 |
| 6,790 | On-Off Sketch: A Fast and Accurate Sketch on Persistence | 2021 | VLDB | 4.9251439e-05 |
| 7,732 | Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items | 2023 | SIGMOD | 4.6657123e-05 |
| 11,222 | A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams | 2023 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 383 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00024820873 |
| 685 | Access Methods For Multiversion Data | 1989 | SIGMOD | 0.00018179465 |
| 781 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016741046 |
| 972 | Immortal DB: Transaction Time Support for SQL Server | 2005 | SIGMOD | 0.00014922442 |
| 1,471 | Adaptive Range Filters for Cold Data: Avoiding Trips to Siberia | 2013 | VLDB | 0.00011830111 |
| 3,045 | Skippy: a New Snapshot Indexing Method for Time Travel in the Storage Manager | 2008 | SIGMOD | 7.6595001e-05 |
| 3,614 | Persistent Data Sketching | 2015 | SIGMOD | 6.9147318e-05 |
| 3,810 | Searching in Time | 2006 | SIGMOD | 6.7394548e-05 |
| 7,515 | Logging Every Footstep: Quantile Summaries for the Entire History | 2010 | SIGMOD | 4.7180617e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,634 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD | 4.4801584e-05 |
| 4,994 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB | 5.78027e-05 |
| 11,374 | New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters | 2022 | VLDB | 4.1945683e-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 |
| 3,838 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD | 6.7134945e-05 |
| 6,831 | Prefix Filter: Practically and Theoretically Better Than Bloom | 2022 | VLDB | 4.9130458e-05 |
| 781 | Spectral Bloom Filters | 2003 | SIGMOD | 0.00016741046 |
| 8,178 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB | 4.5672537e-05 |
| 4,446 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB | 6.1800659e-05 |