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


DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://zenodo.org/record/33991</identifier>
  <creators>
    <creator>
      <creatorName>Amarilli, Antoine</creatorName>
      <givenName>Antoine</givenName>
      <familyName>Amarilli</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-7977-4441</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Ben Hamouda, Fabrice</creatorName>
      <givenName>Fabrice</givenName>
      <familyName>Ben Hamouda</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-8300-1820</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Bourse, Florian</creatorName>
      <givenName>Florian</givenName>
      <familyName>Bourse</familyName>
    </creator>
    <creator>
      <creatorName>Morisset, Robin</creatorName>
      <givenName>Robin</givenName>
      <familyName>Morisset</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-5254-0645</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Naccache, David</creatorName>
      <givenName>David</givenName>
      <familyName>Naccache</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-8651-6555</nameIdentifier>
    </creator>
    <creator>
      <creatorName>Rauzy, Pablo</creatorName>
      <givenName>Pablo</givenName>
      <familyName>Rauzy</familyName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="http://orcid.org/">0000-0002-6293-3231</nameIdentifier>
    </creator>
  </creators>
  <titles>
    <title>From Rational Number Reconstruction to Set Reconciliation and File Synchronization</title>
  </titles>
  <publisher>Zenodo</publisher>
  <publicationYear>2013</publicationYear>
  <dates>
    <date dateType="Issued">2013-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Book section</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://zenodo.org/record/33991</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/978-3-642-41157-1_1</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">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.</description>
  </descriptions>
</resource>
225
76
views
downloads
Views 225
Downloads 76
Data volume 35.3 MB
Unique views 223
Unique downloads 76

Share

Cite as