What's the difference?: efficient set reconciliation without prior context

  title={What's the difference?: efficient set reconciliation without prior context},
  author={David Eppstein and Michael T. Goodrich and Frank Uyeda and George Varghese},
We describe a synopsis structure, the Difference Digest, that allows two nodes to compute the elements belonging to the set difference in a single round with communication overhead proportional to the size of the difference times the logarithm of the keyspace. While set reconciliation can be done efficiently using logs, logs require overhead for every update and scale poorly when multiple users are to be reconciled. By contrast, our abstraction assumes no prior context and is useful in… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 91 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 67 extracted citations

Finding Persistent Items in Distributed Datasets

IEEE INFOCOM 2018 - IEEE Conference on Computer Communications • 2018
View 7 Excerpts
Highly Influenced

Reconciling Graphs and Sets of Sets

View 5 Excerpts
Highly Influenced

An Efficient PGP Keyserver without Prior Context

Count Values Hashes
View 4 Excerpts
Highly Influenced

Efficient Multiset Synchronization

IEEE/ACM Transactions on Networking • 2017
View 10 Excerpts
Highly Influenced

91 Citations

Citations per Year
Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-5 of 5 references

Similar Papers

Loading similar papers…