Book section Open Access

From Rational Number Reconstruction to Set Reconciliation and File Synchronization

Amarilli, Antoine; Ben Hamouda, Fabrice; Bourse, Florian; Morisset, Robin; Naccache, David; Rauzy, Pablo

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Amarilli, Antoine</dc:creator>
  <dc:creator>Ben Hamouda, Fabrice</dc:creator>
  <dc:creator>Bourse, Florian</dc:creator>
  <dc:creator>Morisset, Robin</dc:creator>
  <dc:creator>Naccache, David</dc:creator>
  <dc:creator>Rauzy, Pablo</dc:creator>
  <dc:description>This work revisits set reconciliation, the problem of synchronizing two multisets of fixed-size values while minimizing transmission complexity. We propose a new number-theoretic reconciliation protocol called Divide and Factor (D&amp;F;) that achieves optimal asymptotic transmission complexity — as do previously known alternative algorithms. We analyze the computational complexities of various D&amp;F; variants, study the problem of synchronizing sets of variable-size files using hash functions and apply D&amp;F; to synchronize file hierarchies taking file locations into account.
We describe btrsync, our open-source D&amp;F; implementation, and benchmark it against the popular software rsync. It appears that btrsync transmits much less data than rsync, at the expense of a relatively modest computational overhead.</dc:description>
  <dc:source>Lecture Notes in Computer Science 1-18 (2013)</dc:source>
  <dc:title>From Rational Number Reconstruction to Set Reconciliation and File Synchronization</dc:title>
Views 270
Downloads 92
Data volume 42.8 MB
Unique views 262
Unique downloads 92


Cite as