Recursive Compaction Method of LSM-tree based Key-value Store 


Vol. 46,  No. 9, pp. 946-950, Sep.  2019
10.5626/JOK.2019.46.9.946


PDF

  Abstract

LSM-tree-based key-value stores exhibit an optimized structure for data writing operations and typically maintain the form of LSM tree by executing a compaction operation. The compaction operation which reads data from the storage device into memory for sorting it and writes back the result data in to the storage device several times causes some problems. In this paper, we analyzed the performance degradation and the write amplification caused by the compaction, and proposed a new compaction method known as recursive compaction. Recursive compaction alleviates the problems involving the compaction operation by utilizing multiple threads to perform multiple compactions at a time, handling read operation and garbage collection properly. We implemented this technique for Google LevelDB and analyzed the results.


  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Kim, S. Son, H. Cho, H. Jung, "Recursive Compaction Method of LSM-tree based Key-value Store," Journal of KIISE, JOK, vol. 46, no. 9, pp. 946-950, 2019. DOI: 10.5626/JOK.2019.46.9.946.


[ACM Style]

Jongbin Kim, Seohui Son, Hyunsoo Cho, and Hyungsoo Jung. 2019. Recursive Compaction Method of LSM-tree based Key-value Store. Journal of KIISE, JOK, 46, 9, (2019), 946-950. DOI: 10.5626/JOK.2019.46.9.946.


[KCI Style]

김종빈, 손서희, 조현수, 정형수, "LSM-tree 기반 Key-value 데이터베이스의 재귀적 컴팩션 기법," 한국정보과학회 논문지, 제46권, 제9호, 946~950쪽, 2019. DOI: 10.5626/JOK.2019.46.9.946.


[Endnote/Zotero/Mendeley (RIS)]  Download


[BibTeX]  Download



Search




Journal of KIISE

  • ISSN : 2383-630X(Print)
  • ISSN : 2383-6296(Electronic)
  • KCI Accredited Journal

Editorial Office

  • Tel. +82-2-588-9240
  • Fax. +82-2-521-1352
  • E-mail. chwoo@kiise.or.kr