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

MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="">
  <controlfield tag="005">20200120173202.0</controlfield>
  <controlfield tag="001">33991</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-8300-1820</subfield>
    <subfield code="a">Ben Hamouda, Fabrice</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Bourse, Florian</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-5254-0645</subfield>
    <subfield code="a">Morisset, Robin</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-8651-6555</subfield>
    <subfield code="a">Naccache, David</subfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-6293-3231</subfield>
    <subfield code="a">Rauzy, Pablo</subfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">465095</subfield>
    <subfield code="z">md5:48ecbc5a2794e217e0a780b9cf9227ea</subfield>
    <subfield code="u"></subfield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2013-01-01</subfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o"></subfield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="y">2013</subfield>
    <subfield code="c">1-18</subfield>
    <subfield code="p">Lecture Notes in Computer Science</subfield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="0">(orcid)0000-0002-7977-4441</subfield>
    <subfield code="a">Amarilli, Antoine</subfield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">From Rational Number Reconstruction to Set Reconciliation and File Synchronization</subfield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Other (Open)</subfield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2"></subfield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">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.</subfield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/978-3-642-41157-1_1</subfield>
    <subfield code="2">doi</subfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">section</subfield>
Views 270
Downloads 92
Data volume 42.8 MB
Unique views 262
Unique downloads 92


Cite as