Characterizing, modeling, and benchmarking {RocksDB}{Key-Value} workloads at facebook
Persistent key-value stores are widely used as building blocks in today's IT infrastructure for
managing and storing large amounts of data. However, studies of characterizing real-world …
managing and storing large amounts of data. However, studies of characterizing real-world …
Serverless computation with {OpenLambda}
We present OpenLambda, a new, open-source platform for building next-generation web
services and applications in the burgeoningmodel of serverless computation. We describe …
services and applications in the burgeoningmodel of serverless computation. We describe …
Pebblesdb: Building key-value stores using fragmented log-structured merge trees
Key-value stores such as LevelDB and RocksDB offer excellent write throughput, but suffer
high write amplification. The write amplification problem is due to the Log-Structured Merge …
high write amplification. The write amplification problem is due to the Log-Structured Merge …
Rocksdb: Evolution of development priorities in a key-value store serving large-scale applications
This article is an eight-year retrospective on development priorities for RocksDB, a key-value
store developed at Facebook that targets large-scale distributed systems and that is …
store developed at Facebook that targets large-scale distributed systems and that is …
{LightNVM}: The linux {Open-Channel}{SSD} subsystem
As Solid-State Drives (SSDs) become commonplace in data-centers and storage arrays,
there is a growing demand for predictable latency. Traditional SSDs, serving block I/Os, fail …
there is a growing demand for predictable latency. Traditional SSDs, serving block I/Os, fail …
LSM-based storage techniques: a survey
Recently, the log-structured merge-tree (LSM-tree) has been widely adopted for use in the
storage layer of modern NoSQL systems. Because of this, there have been a large number …
storage layer of modern NoSQL systems. Because of this, there have been a large number …
Dash: Scalable hashing on persistent memory
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 …
cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent …
PACTree: A high performance persistent range index using PAC guidelines
Non-Volatile Memory (NVM), which provides relatively fast and byte-addressable
persistence, is now commercially available. However, we cannot equate a real NVM with a …
persistence, is now commercially available. However, we cannot equate a real NVM with a …
Monkey: Optimal navigable key-value store
In this paper, we show that key-value stores backed by an LSM-tree exhibit an intrinsic trade-
off between lookup cost, update cost, and main memory footprint, yet all existing designs …
off between lookup cost, update cost, and main memory footprint, yet all existing designs …
Redesigning {LSMs} for Nonvolatile Memory with {NoveLSM}
We present NoveLSM, a persistent LSM-based key-value storage system designed to
exploit non-volatile memories and deliver low latency and high throughput to applications …
exploit non-volatile memories and deliver low latency and high throughput to applications …