On Performance Stability in LSM-based Storage Systems (Extended Version) release_4cucjwh735hdrjtjzx5okobyj4

by Chen Luo, Michael J. Carey

Released as a article .

2020  

Abstract

The Log-Structured Merge-Tree (LSM-tree) has been widely adopted for use in modern NoSQL systems for its superior write performance. Despite the popularity of LSM-trees, they have been criticized for suffering from write stalls and large performance variances due to the inherent mismatch between their fast in-memory writes and slow background I/O operations. In this paper, we use a simple yet effective two-phase experimental approach to evaluate write stalls for various LSM-tree designs. We further explore the design choices of LSM merge schedulers to minimize write stalls given an I/O bandwidth budget. We have conducted extensive experiments in the context of the Apache AsterixDB system and we present the results here.
In text/plain format

Archived Files and Locations

application/pdf  1.8 MB
file_2ty3zuhak5fw5bomlndjiehan4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2020-04-11
Version   v6
Language   en ?
arXiv  1906.09667v6
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7c1e6c84-4f5b-452b-963d-4dbee3f6e132
API URL: JSON