Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Summary: Introduces Parity Bitmap Sketch (PBS), an ECC-based set-reconciliation scheme achieving O(d) computation with communication overhead ≈2× the theoretical minimum—combining IBF-like speed with ECC-like compactness. Provides rigorous performance analysis and near-optimal parameter tuning. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Long Gong (Georgia Institute of Technology)
- 2. Ziheng Liu (Peking University)
- 3. Liang Liu (Georgia Institute of Technology)
- 4. Jun Xu (Georgia Institute of Technology)
- 5. Mitsunori Ogihara (University of Miami)
- 6. Tong Yang (Peking University)
BibTeX Citation
@article{gong_vldb21,
title = {{Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)}},
author = {Gong, Long and Liu, Ziheng and Liu, Liang and Xu, Jun and Ogihara, Mitsunori and Yang, Tong},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {4},
pages = {458--470},
doi = {10.14778/3436905.3436906},
url = {https://doi.org/10.14778/3436905.3436906},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,996 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS |
| 2 | 3,533 | Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters | 2006 | SIGMOD |
| 3 | 11,164 | An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities | 2024 | SIGMOD |
| 4 | 3,474 | An Efficient Partition Based Method for Exact Set Similarity Joins | 2016 | VLDB |
| 5 | 8,612 | Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying | 2021 | SIGMOD |
| 6 | 8,667 | On the algebra of data sketches | 2021 | VLDB |
| 7 | 6,220 | Robust Set Reconciliation | 2014 | SIGMOD |
| 8 | 8,408 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB |
| 9 | 11,899 | Reconciling Graphs and Sets of Sets | 2018 | PODS |
| 10 | 11,836 | Robust Set Reconciliation via Locality Sensitive Hashing | 2019 | PODS |