KVSTL: An Application Support to LSM-Tree Based Key-Value Store via Shingled Translation Layer Data Management

Shuo Han Chen*, Yuhong Liang, Ming Chang Yang

*此作品的通信作者

研究成果: Article同行評審

5 引文 斯高帕斯(Scopus)

摘要

LSM-tree based Key-value (KV) stores greatly fit the needs of write-intensive applications with its efficient data store and retrieval operations to datasets. To accommodate ever-growing datasets, shingled magnetic recording (SMR) drives have become a popular option to provide large storage capacity for KV stores at low cost. SMR drives achieve high storage density via overlapping tracks on the disk surface. However, the overlapped track layout induces the sequential-write constraint and prevents KV stores from storing and rearranging KV pairs efficiently. In this paper, we present KVSTL, a KV store aware Shingled Translation Layer (STL), to preserve the merits of existing KV stores, while exploiting the high storage density of SMR drives. KVSTL is proposed as an application support to hide the management complexity of SMR drives and facilitates the management of SMR drives via passing only the 'level' and 'invalidation' information of LSM-tree based KV stores onto SMR drives. The proposed KVSTL achieves its performance enhancement via managing key-value pairs with level awareness and enabling efficient storage space management with the invalidation information. The results show that KVSTL can reduce the written data amount for 69.45 percent on average and the latency for up to 62.72 percent when compared with SMR-based LevelDB.

原文English
頁(從 - 到)1598-1611
頁數14
期刊IEEE Transactions on Computers
71
發行號7
DOIs
出版狀態Published - 1 7月 2022

指紋

深入研究「KVSTL: An Application Support to LSM-Tree Based Key-Value Store via Shingled Translation Layer Data Management」主題。共同形成了獨特的指紋。

引用此