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


JSON Export

{
  "files": [
    {
      "links": {
        "self": "https://zenodo.org/api/files/a5ee576b-d586-4df3-b1ac-80fbc3440da3/article.pdf"
      }, 
      "checksum": "md5:48ecbc5a2794e217e0a780b9cf9227ea", 
      "bucket": "a5ee576b-d586-4df3-b1ac-80fbc3440da3", 
      "key": "article.pdf", 
      "type": "pdf", 
      "size": 465095
    }
  ], 
  "owners": [
    13380
  ], 
  "doi": "10.1007/978-3-642-41157-1_1", 
  "stats": {
    "version_unique_downloads": 76.0, 
    "unique_views": 223.0, 
    "views": 225.0, 
    "version_views": 225.0, 
    "unique_downloads": 76.0, 
    "version_unique_views": 223.0, 
    "volume": 35347220.0, 
    "version_downloads": 76.0, 
    "downloads": 76.0, 
    "version_volume": 35347220.0
  }, 
  "links": {
    "doi": "https://doi.org/10.1007/978-3-642-41157-1_1", 
    "latest_html": "https://zenodo.org/record/33991", 
    "bucket": "https://zenodo.org/api/files/a5ee576b-d586-4df3-b1ac-80fbc3440da3", 
    "badge": "https://zenodo.org/badge/doi/10.1007/978-3-642-41157-1_1.svg", 
    "html": "https://zenodo.org/record/33991", 
    "latest": "https://zenodo.org/api/records/33991"
  }, 
  "created": "2016-02-16T09:56:07+00:00", 
  "updated": "2020-01-20T17:32:02.945037+00:00", 
  "conceptrecid": "619281", 
  "revision": 11, 
  "id": 33991, 
  "metadata": {
    "access_right_category": "success", 
    "doi": "10.1007/978-3-642-41157-1_1", 
    "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&F;) that achieves optimal asymptotic transmission complexity \u2014 as do previously known alternative algorithms. We analyze the computational complexities of various D&F; variants, study the problem of synchronizing sets of variable-size files using hash functions and apply D&F; to synchronize file hierarchies taking file locations into account.\nWe describe btrsync, our open-source D&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.", 
    "license": {
      "id": "other-open"
    }, 
    "title": "From Rational Number Reconstruction to Set Reconciliation and File Synchronization", 
    "journal": {
      "year": "2013", 
      "pages": "1-18", 
      "title": "Lecture Notes in Computer Science"
    }, 
    "relations": {
      "version": [
        {
          "count": 1, 
          "index": 0, 
          "parent": {
            "pid_type": "recid", 
            "pid_value": "619281"
          }, 
          "is_last": true, 
          "last_child": {
            "pid_type": "recid", 
            "pid_value": "33991"
          }
        }
      ]
    }, 
    "publication_date": "2013-01-01", 
    "creators": [
      {
        "orcid": "0000-0002-7977-4441", 
        "name": "Amarilli, Antoine"
      }, 
      {
        "orcid": "0000-0002-8300-1820", 
        "name": "Ben Hamouda, Fabrice"
      }, 
      {
        "name": "Bourse, Florian"
      }, 
      {
        "orcid": "0000-0002-5254-0645", 
        "name": "Morisset, Robin"
      }, 
      {
        "orcid": "0000-0002-8651-6555", 
        "name": "Naccache, David"
      }, 
      {
        "orcid": "0000-0002-6293-3231", 
        "name": "Rauzy, Pablo"
      }
    ], 
    "access_right": "open", 
    "resource_type": {
      "subtype": "section", 
      "type": "publication", 
      "title": "Book section"
    }
  }
}
225
76
views
downloads
Views 225
Downloads 76
Data volume 35.3 MB
Unique views 223
Unique downloads 76

Share

Cite as