Enabling a B+-tree-based Data Management Scheme for Key-value Store over SMR-based SSHD

Owing to the explosive growth of data volume, high areal density storage technologies have been proposed in the past few years. Among them, shingled magnetic recording (SMR) has been regarded as the most promising candidate to replace current conventional hard disk drive based on the perpendicular magnetic recording technology. However, SMR technology not only brings large capacity storage devices but also results in terrible random access performance. For increasing the random access performance of SMR, solid-state hybrid drive (SSHD) seems a possible solution in storage system development. Nevertheless, when an SMR-based SSHD is adopted to a large-scale data management system, a severe performance degeneration will happen because an indexing scheme for access efficiency always maintains data in the large-scale data management system. More specifically, jointly managing indexing keys and data values on an SSHD drive will result in the massive amount of write amplification because of read-merge-write operations and garbage collection processes. Based on such motivations, this work proposed a total solution, namely XsB+-tree, to establish a high-performance B+-tree-based data management scheme for key-value store systems. To the best of our knowledge, this work is the first work to discuss the total solution for the key-value store over an SMR-based SSHD. According to our experimental results, XsB+ -tree can improve the access time by 80% on average and prolong the lifetime of SSD up to 19%.

[1]  Tei-Wei Kuo,et al.  An adaptive striping architecture for flash memory storage systems of embedded systems , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[2]  Wei-Kuan Shih,et al.  Enabling Sequential-write-constrained B+-tree Index Scheme to Upgrade Shingled Magnetic Recording Storage Performance , 2019, ACM Trans. Embed. Comput. Syst..

[3]  Jin Li,et al.  FlashStore , 2010, Proc. VLDB Endow..

[4]  H. Iwasaki,et al.  Future Options for HDD Storage , 2009, IEEE Transactions on Magnetics.

[5]  Qin Jin,et al.  Persistent B+-Trees in Non-Volatile Main Memory , 2015, Proc. VLDB Endow..

[6]  S. Greaves,et al.  Shingled Recording for 2–3 Tbit/in $^2$ , 2009 .

[7]  Jin Xiong,et al.  HiKV: A Hybrid Index Key-Value Store for DRAM-NVM Memory Systems , 2017, USENIX Annual Technical Conference.

[8]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[9]  Yuan-Hao Chang,et al.  Logical data packing for multi-chip flash-memory storage systems , 2015, 2015 IEEE Non-Volatile Memory System and Applications Symposium (NVMSA).

[10]  Eddie Kohler,et al.  Cache craftiness for fast multicore key-value storage , 2012, EuroSys '12.

[11]  Dandan Wang,et al.  Larger , Cheaper , but Faster : SSD-SMR Hybrid Storage Boosted by a New SMR-oriented Cache Framework , 2017 .

[12]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[13]  Scott A. Brandt,et al.  Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[14]  Garth A. Gibson,et al.  Shingled Magnetic Recording: Areal Density Increase Requires New Data Management , 2013, login Usenix Mag..

[15]  Andrea C. Arpaci-Dusseau,et al.  WiscKey: Separating Keys from Values in SSD-conscious Storage , 2016, FAST.

[16]  John K. Ousterhout,et al.  SLIK: Scalable Low-Latency Indexes for a Key-Value Store , 2016, USENIX Annual Technical Conference.

[17]  Jongmoo Choi,et al.  Caching less for better performance: balancing cache size and update cost of flash memory cache in hybrid storage systems , 2012, FAST.

[18]  Gregory R. Ganger,et al.  The DiskSim Simulation Environment Version 4.0 Reference Manual (CMU-PDL-08-101) , 1998 .