KVSSD: Close Integration of LSM Trees and Flash Translation Layer for Write-Efficient KV Store

Sung-Ming Wu^a, Kai-Hsiang Lin^b and Li-Pin Chang^c
National Chiao-Tung University Hsinchu, Taiwan, R.O.C.
^atbches.cs03g@nctu.edu.tw
^bk99182003@gmail.com
^clpchang@cs.nctu.edu.tw

ABSTRACT

Log‐Structured‐Merge (LSM) trees are a write optimized data structure for lightweight, high‐performance Key Value (KV) store. Solid State Disks (SSDs) provide acceleration of KV operations on LSM trees. However, this hierarchical design involves multiple software layers, including the LSM tree, host file system, and Flash Translation Layer (FTL), causing cascading write amplifications. We propose KVSSD, a close integration of LSM trees and the FTL, to manage write amplifications from different layers. KVSSD exploits the FTL mapping mechanism to implement copy‐free compaction of LSM trees, and it enables direct data allocation in flash memory for efficient garbage collection. In our experiments, compared to the hierarchical design, our KVSSD reduced the write amplification by 88% and improved the throughput by 347%.

---

Full Text (PDF)

© 2018 EDAA. All rights reserved.