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
Contributor : David Baelde <>
Submitted on : Wednesday, December 31, 2014 - 3:40:42 PM
Last modification on : Friday, January 30, 2015 - 1:17:41 AM
Long-term archiving on: Wednesday, April 1, 2015 - 10:26:08 AM


Files produced by the author(s)


  • HAL Id : hal-01099136, version 1


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-01099136v1⟩



Record views


Files downloads