Corpus ID: 237940356

Accelerating LSM-Tree with the Dentry Management of File System

  title={Accelerating LSM-Tree with the Dentry Management of File System},
  author={Yanpeng Hu and Chundong Wang},
  • Yanpeng Hu, Chundong Wang
  • Published 27 September 2021
  • Computer Science
  • ArXiv
The log-structured merge tree (LSM-tree) gains wide popularity in building key-value (KV) stores. It employs logs to back up arriving KV pairs and maintains a few on-disk levels with exponentially increasing capacity limits, resembling a tiered tree-like structure. A level comprises SST files, each of which holds a sequence of sorted KV pairs. From time to time, LSM-tree redeploys KV pairs from a full level to the lower level by compaction, which merge-sorts and moves KV pairs among SST files… Expand

Figures and Tables from this paper


LSM-Tree Managed Storage for Large-Scale Key-Value Store
This paper proposes LDS, an L SM-tree Direct Storage system that manages the storage space based on the LSM-tree objects and provides simplified consistency control by leveraging the copy-on-write nature of the Lsm-tree structure, to fully reap the benefits ofLSM-trees. Expand
LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items
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. Expand
SLM-DB: Single-Level Key-Value Store with Persistent Memory
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. Expand
KVSSD: Close integration of LSM trees and flash translation layer for write-efficient KV store
This work proposes KVSSD, a close integration of LSM trees and the FTL, to manage write amplifications from different layers, and it enables direct data allocation in flash memory for efficient garbage collection. Expand
Building Efficient Key-Value Stores via a Lightweight Compaction Tree
This work introduces a lightweight compaction tree (LWC-tree), a variant of LSM-tree index optimized for minimizing the write amplification and maximizing the system throughput, and implements three key-value LWC-stores on different storage mediums. Expand
TABLEFS: Enhancing Metadata Efficiency in the Local File System
A stacked file system, TABLEFS, which uses another local file system as an object store, which can perform comparably to Ext4, XFS and Btrfs on data-intensive benchmarks, and can outperform them by 50% to as much as 1000% for metadata-intensive workloads. Expand
TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores
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. Expand
Accordion: Better Memory Organization for LSM Key-Value Stores
Accordion is presented - an algorithm that addresses problems by re-applying the LSM design principles to memory management by demonstrating Accordion's double-digit performance gains versus the baseline HBase implementation and discussing some unexpected lessons learned in the process. Expand
BoLT: Barrier-optimized LSM-Tree
To reduce file consistency overhead without increasing key ranges of SSTables, a variant of LSM-tree is presented, namely, BoLT (Barrier-optimized L SM-Tree), that minimizes the number of calls to fsync()/fdatasync() barriers while taking advantage of fine-grained S STables. Expand
FPGA-Accelerated Compactions for LSM-based Key-Value Store
This work identifies that slow compactions jeopardize the system performance due to unchecked oversized levels in the LSM-tree, and proposes to offload compactions to FPGAs aiming at accelerating compactions and reducing the CPU bottleneck for storing short KVs. Expand