TY - GEN
T1 - Efficient Sanitization Design for LSM-based Key-Value Store over 3D MLC NAND Flash
AU - Chen, Liang Chi
AU - Yu, Shu Qi
AU - Ho, Chien Chung
AU - Wang, Wei Chen
AU - Li, Yung Chun
N1 - Funding Information:
This work was supported in part by the National Science and Technology Council, Taiwan under grant no. 109-2221-E-006-215-MY3.
Publisher Copyright:
© 2023 Owner/Author(s).
PY - 2023/3/27
Y1 - 2023/3/27
N2 - Conventional LSM tree designs delete data by inserting a delete mark to the specified key, and they thus it leaves several out-of-date values to the specified key on the LSM tree. As a result, the LSM tree encounters a serious data security issue due to the undeleted values when there arises the need for data sanitization. Sanitization is a time-consuming process that involves completely removing sensitive data from storage devices. Flash-based SSDs are widely used in many systems, but they lack an in-place update feature, which makes it difficult for LSM trees to maintain both privacy and performance on these devices. This work proposes an efficient sanitizable LSM-tree design for LSM-based key-value store over 3D NAND flash memories. Our proposed efficient sanitizable LSM-tree design focuses on integrating the processes of key-value pair updating and the execution of sanitization by exploiting our proposed influence-conscious programming method. The capability of the proposed design is evaluated by a series of experiments, for which we have very encouraging results.
AB - Conventional LSM tree designs delete data by inserting a delete mark to the specified key, and they thus it leaves several out-of-date values to the specified key on the LSM tree. As a result, the LSM tree encounters a serious data security issue due to the undeleted values when there arises the need for data sanitization. Sanitization is a time-consuming process that involves completely removing sensitive data from storage devices. Flash-based SSDs are widely used in many systems, but they lack an in-place update feature, which makes it difficult for LSM trees to maintain both privacy and performance on these devices. This work proposes an efficient sanitizable LSM-tree design for LSM-based key-value store over 3D NAND flash memories. Our proposed efficient sanitizable LSM-tree design focuses on integrating the processes of key-value pair updating and the execution of sanitization by exploiting our proposed influence-conscious programming method. The capability of the proposed design is evaluated by a series of experiments, for which we have very encouraging results.
UR - http://www.scopus.com/inward/record.url?scp=85162849652&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85162849652&partnerID=8YFLogxK
U2 - 10.1145/3555776.3577780
DO - 10.1145/3555776.3577780
M3 - Conference contribution
AN - SCOPUS:85162849652
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 72
EP - 75
BT - Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, SAC 2023
PB - Association for Computing Machinery
T2 - 38th Annual ACM Symposium on Applied Computing, SAC 2023
Y2 - 27 March 2023 through 31 March 2023
ER -