Byte-addressable persistent memory (PM) brings hash tables the potential of low latency,
cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent …

Modern block-addressable NVMe SSDs provide much higher bandwidth and similar
performance for random and sequential access. Persistent key-value stores (KVs) designed …

The ever increasing amount of data being handled in data centers causes an intrinsic
inefficiency: moving data around is expensive in terms of bandwidth, latency, and power …

Many social-media and IoT services have very large working sets consisting of billions of
tiny (≈ 100 B) objects. Large, flash-based caches are important to serving these working …

The von Neumann bottleneck is imposed due to the explosion of data transfers and
emerging data-intensive applications in heterogeneous system architectures. The …

Key-value store based on a log-structured merge-tree (LSM-tree) is preferable to hash-
based KV store because an LSM-tree can support a wider variety of operations and show …

Today's cloud storage stack is extremely resource hungry, burning 10-20% of datacenter
x86 cores, a major" storage tax" that cloud providers must pay. Yet, the complex cloud …

Persistent memory (PM) is increasingly being leveraged to build hash-based indexing
structures featuring cheap persistence, high performance, and instant recovery, especially …

The cloud infrastructure motivates disaggregation of monolithic data stores into components
that are assembled together based on an application's workload. This study investigates …

Non-relational database systems (NRDS) such as graph and key-value have gained
attention in various trending business and analytical application domains. However, while …