• Corpus ID: 246210482

Efficient Compactions Between Storage Tiers with PrismDB

@inproceedings{Raina2020EfficientCB,
  title={Efficient Compactions Between Storage Tiers with PrismDB},
  author={Ashwini Raina and Jianan Lu and Asaf Cidon and Michael J. Freedman},
  year={2020}
}
In recent years, emerging storage hardware technologies have fo-cused on divergent goals: better performance or lower cost-per-bit. Correspondingly, data systems that employ these technologies are typically optimized either to be fast (but expensive) or cheap (but slow). We take a different approach: by architecting a storage engine to natively utilize two tiers of fast and low-cost storage technologies, we can achieve a Pareto-efficient balance between performance and cost-per-bit.Thispaper… 

References

SHOWING 1-10 OF 70 REFERENCES

Mutant: Balancing Storage Cost and Latency in LSM-Tree Data Stores

TLDR
Mutant is a new storage layer for log-structured merge tree (LSM-tree) data stores that dynamically balances database cost and performance by organizing SSTables (files that store a subset of records) into different storage types based on SSTable access frequencies.

An efficient design and implementation of LSM-tree based key-value store on open-channel SSD

TLDR
LevelDB is extended to explicitly leverage the multiple channels of an SSD to exploit its abundant parallelism and the throughput of storage system can be improved by more than 4X after applying all proposed optimization techniques.

PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees

TLDR
PebblesDB is built, a high-performance key-value store, by modifying HyperLevelDB to use the FLSM data structure, and two widely-used NoSQL stores, MongoDB and HyperDex, are modified to use PebblesDB as their underlying storage engine.

TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores

TLDR
TRIAD improves LSM KV throughput by reducing the write amplification arising in the maintenance of the LSM tree structure by a factor of up to 4x, and decreases the amount of I/O by an order of magnitude.

SILK+ Preventing Latency Spikes in Log-Structured Merge Key-Value Stores Running Heterogeneous Workloads

TLDR
The notion of an Input/Output (I/O) bandwidth scheduler for an LSM-based KV store to reduce tail latency caused by interference of flushing and compactions and by workload heterogeneity is introduced.

Scaling concurrent log-structured data stores

Log-structured data stores (LSM-DSs) are widely accepted as the state-of-the-art implementation of key-value stores. They replace random disk writes with sequential I/O, by accumulating large batches

Reaping the performance of fast NVM storage with uDepot

Many applications require low-latency key-value storage, a requirement that is typically satisfied using key-value stores backed by DRAM. Recently, however, storage devices built on novel NVM

SLM-DB: Single-Level Key-Value Store with Persistent Memory

TLDR
This paper presents a novel KV store, the Single-Level Merge DB (SLM-DB), which takes advantage of both the B+-tree index and the Log-Structured Merge Trees (LSM-tree) approach by making the best use of fast persistent memory.

EvenDB: optimizing key-value storage for spatial locality

TLDR
EvenDB, a general-purpose persistent KV-store optimized for spatially-local workloads, combines spatial data partitioning with LSM-like batch I/O and achieves high throughput, ensures consistency under multi-threaded access, and reduces write amplification.

LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items

TLDR
LSM-trie is proposed, a KV storage system that substantially reduces metadata for locating KV items, reduces write amplification by an order of magnitude, and needs only two disk accesses with each KV read even when only less than 10% of metadata (Bloom filters) can be held in memory.
...