基于lsm的3D MLC NAND闪存键值存储的高效消毒设计

IF 0.4 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Liang-Chi Chen, Shu-Qi Yu, Chien-Chung Ho, Wei-Chen Wang, Yung-Chun Li
{"title":"基于lsm的3D MLC NAND闪存键值存储的高效消毒设计","authors":"Liang-Chi Chen, Shu-Qi Yu, Chien-Chung Ho, Wei-Chen Wang, Yung-Chun Li","doi":"10.1145/3555776.3577780","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient Sanitization Design for LSM-based Key-Value Store over 3D MLC NAND Flash\",\"authors\":\"Liang-Chi Chen, Shu-Qi Yu, Chien-Chung Ho, Wei-Chen Wang, Yung-Chun Li\",\"doi\":\"10.1145/3555776.3577780\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":42971,\"journal\":{\"name\":\"Applied Computing Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Computing Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3555776.3577780\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Computing Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3555776.3577780","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

传统的LSM树设计通过在指定的键中插入删除标记来删除数据,因此会在LSM树中为指定的键留下一些过期的值。因此,当需要进行数据清理时,由于未删除的值,LSM树会遇到严重的数据安全问题。消毒处理是一个耗时的过程,需要从存储设备中完全移除敏感数据。基于闪存的ssd广泛应用于许多系统,但它们缺乏就地更新功能,这使得LSM树难以在这些设备上同时维护隐私和性能。本研究提出了一种高效的可清理lsm树设计,用于基于lsm的键值存储在3D NAND闪存上。我们提出的高效的可清理的lsm树设计侧重于通过利用我们提出的影响意识编程方法集成键值对更新和清理的执行过程。通过一系列实验对所提出设计的性能进行了评价,得到了令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Sanitization Design for LSM-based Key-Value Store over 3D MLC NAND Flash
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Computing Review
Applied Computing Review COMPUTER SCIENCE, INFORMATION SYSTEMS-
自引率
40.00%
发文量
8
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信