Scalable Multi-Versioning Ordered Key-Value Stores with Persistent Memory Support - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Scalable Multi-Versioning Ordered Key-Value Stores with Persistent Memory Support

Bogdan Nicolae

Abstract

Ordered key-value stores (or sorted maps/dictionaries) are a fundamental building block in a large variety of both sequential and parallel/distributed algorithms. However, most state-of-art approaches are either based on ephemeral inmemory representations that are difficult to persist and/or not scalable enough under concurrent access (e.g., red-black trees, skip lists), and/or not lightweight enough (e.g. database engines). Furthermore, there is an increasing need to provide versioning support, which is needed in a variety of scenarios: introspection, provenance tracking, revisiting previous intermediate results. To address these challenges, we propose a new lightweight dictionary data structure that simultaneously provides support for multiversioning, persistency and scalability under concurrent access. We demonstrate its effectiveness through a series of experiments, in which it outperforms several state-of-art approaches, both in terms of vertical and horizontal scalability.
Fichier principal
Vignette du fichier
DataStates-DL.pdf (487.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03598396 , version 1 (05-03-2022)

Identifiers

  • HAL Id : hal-03598396 , version 1

Cite

Bogdan Nicolae. Scalable Multi-Versioning Ordered Key-Value Stores with Persistent Memory Support. The 36th IEEE International Parallel &Distributed Processing Symposium (IPDPS 2022), IEEE, May 2022, Lyon (virtuel), France. ⟨hal-03598396⟩
127 View
558 Download

Share

Gmail Facebook X LinkedIn More