Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)

Summary: Parity Bitmap Sketch (PBS) is an ECC-based set reconciliation scheme that achieves O(d) computation like IBF while keeping communication near twice the theoretical minimum. Also introduces an analytical framework for precise metrics and tuning. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12566
Venue: VLDB
Year: 2021
Pagerank: -
Overall Rank: 13,270 | 7.69%
DOI: 10.14778/3436905.3436906

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,254	PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads	2019	VLDB	4.3690661e-05
5,902	The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication	2015	PODS	5.2796864e-05
3,838	Approximately Detecting Duplicates for Streaming Data using Stable Bloom Filters	2006	SIGMOD	6.7134945e-05
10,946	An LDP Compatible Sketch for Securely Approximating Set Intersection Cardinalities	2024	SIGMOD	4.1945683e-05
4,050	An Efficient Partition Based Method for Exact Set Similarity Joins	2016	VLDB	6.4953612e-05
8,634	Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying	2021	SIGMOD	4.4801584e-05
8,452	On the algebra of data sketches	2021	VLDB	4.5086031e-05
4,297	Robust Set Reconciliation	2014	SIGMOD	6.2885419e-05
8,178	A Shifting Bloom Filter Framework for Set Queries	2016	VLDB	4.5672537e-05
11,642	Robust Set Reconciliation via Locality Sensitive Hashing	2019	PODS	4.1945683e-05