Mergeable persistent data structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Mergeable persistent data structures

Benjamin Farinier
  • Function : Author
  • PersonId : 962753
Thomas Gazagnaire
  • Function : Author
  • PersonId : 962754
Anil Madhavapeddy
  • Function : Author
  • PersonId : 962755

Abstract

Irmin is an OCaml library to design purely functional data structures that can be persisted on disk and be merged and synchronised efficiently. In this paper, we focus on the "merge" aspect of the library and present two data structures built on top of Irmin: (i) queues and (ii) ropes that extend the corresponding purely functional data structures with a 3-way merge operation. We provide early theoretical and practical complexity results for these new data structures. Irmin is available as open-source code as part of the MirageOS project.
Fichier principal
Vignette du fichier
paper.pdf (266.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01099136 , version 1 (31-12-2014)
hal-01099136 , version 2 (21-01-2015)

Identifiers

  • HAL Id : hal-01099136 , version 2

Cite

Benjamin Farinier, Thomas Gazagnaire, Anil Madhavapeddy. Mergeable persistent data structures. Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France. ⟨hal-01099136v2⟩
592 View
1249 Download

Share

Gmail Facebook X LinkedIn More