Advertisement

KT-Store: A Key-Order and Write-Order Hybrid Key-Value Store with High Write and Range-Query Performance

  • Haobo Wang
  • Yinliang YueEmail author
  • Shuibing He
  • Weiping Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11276)

Abstract

With the data volume increasing, key-value (KV) store plays an important role in today’s storage systems due to its flexible architecture and good scalability. There are two types of data organization in current KV stores: key-order layout and write-order layout, which organize records according to key order and write sequence, respectively. While the former and the latter layouts deliver high throughput for range-query and write operations respectively, neither of them can perform well for both write and range-query operations. In this paper, we propose a hybrid KV store, KT-Store, which combines the key-order and write-order layout together to improve performance. More specifically, KT-Store stores keys and value metadata into a LSM-tree, and stores values into multiple tables called TrieTables. By inserting the value among multiple TrieTables in a key-order fashion leveraging a trie, and into a specific TrieTable in a write-order fashion, KT-Store can obtain the advantages of existing two layout types and avoid their shortcomings. We implement KT-Store in RocksDB 5.7.2. Extensive evaluations demonstrate that KT-Store can simultaneously obtain encouraging write and range-query performance: compared with key-order based RocksDB, the write performance is improved by \(4.3\times -12.6\times \) on HDDs; compared with write-order based Wisckey, KT-Store has \(54.2\times -112.6\times \) range-query performance on HDDs. Besides, KT-Store also has encouraging performance on SSDs.

Notes

Acknowledgments

This work was partially supported by Youth Innovation Promotion Association of Chinese Academy of Sciences No. 2016146, the National Science Foundation of China under Grant No. 61303056, No. 61572377, No. 61602467 and No. 6173396, and the Natural Science Foundation of Hubei Province of China under Grant No. 2017CFC889.

References

  1. 1.
    Beaver, D., Kumar, S., Li, H.C., Sobel, J., Vajgel, P., et al.: Finding a needle in haystack: Facebook’s photo storage. In: OSDI, vol. 10, pp. 1–8 (2010)Google Scholar
  2. 2.
    Yue, Y., He, B., Li, Y., Wang, W.: Building an efficient put-intensive key-value store with skip-tree. IEEE Trans. Parallel Distrib. Syst. 28(4), 961–973 (2017)CrossRefGoogle Scholar
  3. 3.
    Shetty, P., Spillane, R.P., Malpani, R., Andrews, B., Seyster, J., Zadok, E.: Building workload-independent storage with VT-trees. In: FAST, pp. 17–30 (2013)Google Scholar
  4. 4.
    Yao, T., et al.: A light-weight compaction tree to reduce I/O amplification toward efficient key-value stores. In: Proceedings of the 33rd International Conference on Massive Storage Systems and Technology (MSST 2017) (2017)Google Scholar
  5. 5.
    Comer, D.: Ubiquitous B-tree. ACM Comput. Surv. (CSUR) 11(2), 121–137 (1979)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Olson, M.A., Bostic, K., Seltzer, M.: Berkeley DB. In: Conference on USENIX Technical Conference, p. 43 (1999)Google Scholar
  7. 7.
    Frühwirt, P., Huber, M., Mulazzani, M., Weippl, E.R.: InnoDB database forensics, pp. 1028–1036 (2010)Google Scholar
  8. 8.
    Rosenblum, M., Ousterhout, J.K.: The design and implementation of a log-structured file system. In: Thirteenth ACM Symposium on Operating Systems Principles, pp. 1–15 (1991)Google Scholar
  9. 9.
    Lu, L., Pillai, T.S., Gopalakrishnan, H., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: WiscKey: separating keys from values in SSD-conscious storage. ACM Trans. Storage (TOS) 13(1), 5 (2017)Google Scholar
  10. 10.
    Wu, X., Xu, Y., Shao, Z., Jiang, S.: LSM-trie: an LSM-tree-based ultra-large key-value store for small data. In: 2015 Proceedings of the 2015 USENIX Conference on USENIX Annual Technical Conference, pp. 71–82. USENIX Association (2015)Google Scholar
  11. 11.
    O’Neil, P., Cheng, E., Gawlick, D., O’Neil, E.: The log-structured merge-tree (LSM-tree). Acta Informatica 33(4), 351–385 (1996)CrossRefGoogle Scholar
  12. 12.
    Zhang, Z., et al.: Pipelined compaction for the LSM-tree. In: IEEE International Parallel and Distributed Processing Symposium, pp. 777–786 (2014)Google Scholar
  13. 13.
    Wang, P., et al.: An efficient design and implementation of LSM-tree based key-value store on open-channel SSD. In: Proceedings of the Ninth European Conference on Computer Systems, p. 16. ACM (2014)Google Scholar
  14. 14.
    Raju, P., Kadekodi, R., Chidambaram, V., Abraham, I.: PebblesDB: building key-value stores using fragmented log-structured merge trees. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 497–514. ACM (2017)Google Scholar
  15. 15.
    Sears, R., Ramakrishnan, R.: bLSM: a general purpose log structured merge tree. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 217–228. ACM (2012)Google Scholar
  16. 16.
    Jermaine, C., Omiecinski, E., Yee, W.G.: The partitioned exponential file for database storage management. VLDB J.- Int. J. Very Large Data Bases 16(4), 417–437 (2007)CrossRefGoogle Scholar
  17. 17.
    Kannan, S., Bhat, N., Gavrilovska, A., Arpaci-Dusseau, A., Arpaci-Dusseau, R.: Redesigning LSMs for nonvolatile memory with NoveLSM. In: 2018 USENIX Annual Technical Conference (USENIX ATC 18), pp. 993–1005. USENIX Association (2018)Google Scholar
  18. 18.
    Spillane, R.P., Shetty, P.J., Zadok, E., Dixit, S., Archak, S.: An efficient multi-tier tablet server storage architecture. In: Proceedings of the 2nd ACM Symposium on Cloud Computing, p. 1. ACM (2011)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2018

Authors and Affiliations

  • Haobo Wang
    • 1
    • 2
  • Yinliang Yue
    • 1
    • 2
    Email author
  • Shuibing He
    • 3
  • Weiping Wang
    • 1
    • 2
  1. 1.Institute of Information EngineeringChinese Academy of SciencesBeijingChina
  2. 2.School of Cyber SecurityUniversity of Chinese Academy of SciencesBeijingChina
  3. 3.School of Computer ScienceWuhan UniversityWuhanChina

Personalised recommendations