Mergeable persistent data structures

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01099136
Contributor : Thomas Gazagnaire <>
Submitted on : Wednesday, January 21, 2015 - 7:02:02 PM
Last modification on : Tuesday, November 19, 2019 - 12:39:59 PM
Long-term archiving on: Wednesday, April 22, 2015 - 10:55:30 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01099136, version 2

Collections

Citation

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⟩

Share

Metrics

Record views

436

Files downloads

382