DBScholar

Back to papers

Robust Set Reconciliation

Summary: Robust set reconciliation via earth mover's distance to tolerate near-duplicate elements, not exact matches. Presents a communication- and time-efficient algorithm with provable guarantees and a matching lower bound, plus strong empirical results. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4961
Venue
SIGMOD
Year
2014
Pagerank
5.9425753e-05
Overall Rank
6,220 | 57.33%
DOI
10.1145/2588555.2610528

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chen_sigmod14,
        title = {{Robust Set Reconciliation}},
        author = {Chen, Di and Konrad, Christian and Yi, Ke and Yu, Wei and Zhang, Qin},
        series = {{SIGMOD} '14},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2588555.2610528},
        url = {https://dl.acm.org/doi/10.1145/2588555.2610528},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,836 Robust Set Reconciliation via Locality Sensitive Hashing 2019 PODS 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers