Mergeable persistent data structuresReport as inadecuate

Mergeable persistent data structures - Download this document for free, or read online. Document in PDF available to download.

1 ENS Lyon - École normale supérieure - Lyon 2 Computer Laboratory Cambridge

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.

Author: Benjamin Farinier - Thomas Gazagnaire - Anil Madhavapeddy -



Related documents