On the Efficient Design of LSM Stores

04/04/2020
by   Martin Weise, et al.
0

In the last decade, key-value data storage systems have gained significantly more interest from academia and industry. These systems face numerous challenges concerning storage space- and read optimization. There exists a large potential for improving current solutions by introducing new management techniques and algorithms. In this paper we give an overview of the basic concept of key-value data storage systems and provide an explanation for bottlenecks. Further we introduce two new memory management algorithms and a improved index structure. Finally, these solutions are compared to each other and discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2020

CedrusDB: Persistent Key-Value Store with Memory-Mapped Lazy-Trie

As RAM is becoming cheaper and growing abundant, it is time to revisit t...
research
08/20/2019

On the Diversity of Memory and Storage Technologies

The last decade has seen tremendous developments in memory and storage t...
research
08/27/2018

Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems

In recent years, the Log Structured Merge (LSM) tree has been widely ado...
research
02/26/2021

An Architecture for Memory Centric Active Storage (MCAS)

The advent of CPU-attached persistent memory technology, such as Intel's...
research
09/20/2023

Vector database management systems: Fundamental concepts, use-cases, and current challenges

Vector database management systems have emerged as an important componen...
research
11/17/2018

Managed Forgetting to Support Information Management and Knowledge Work

Trends like digital transformation even intensify the already overwhelmi...
research
06/24/2020

Design And Develop Network Storage Virtualization By Using GNS3

Virtualization is an emerging and optimistic prospect in the IT industry...

Please sign up or login with your details

Forgot password? Click here to reset