Mergeable persistent data structures
| Autor: | Farinier, Benjamin, Gazagnaire, Thomas, Madhavapeddy, Anil |
|---|---|
| Přispěvatelé: | École normale supérieure de Lyon (ENS de Lyon), Computer Laboratory [Cambridge], University of Cambridge [UK] (CAM), David Baelde, Jade Alglave, Gazagnaire, Thomas |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Zdroj: | Actes des Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015) Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015) Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France |
| Popis: | National audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|