Time-constrained persistent deletion for key-value store engine on ZNS SSD

被引:0
作者
Nie, Shiqiang [1 ]
Lei, Tong [1 ]
Niu, Jie [1 ]
Hu, Qihan [1 ]
Liu, Song [1 ]
Wu, Weiguo [1 ]
机构
[1] Xi An Jiao Tong Univ, Sch Comp Sci & Technol, Xian 710049, Shaanxi, Peoples R China
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2025年 / 164卷
基金
中国国家自然科学基金;
关键词
ZNS SSD; Data deletion; NAND flash; LSM-tree; Key-value store;
D O I
10.1016/j.future.2024.107598
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The inherent out-of-place update characteristic of the Log-Structured Merge tree (LSM tree) cannot guarantee persistent deletion within a specific time window, leading to potential data privacy and security issues. Existing solutions like Lethe-Fade ensure time-constrained persistent deletion but introduce considerable write overhead, worsening the write amplification issue, particularly for key-value stores on ZNS SSD. To address this problem, we propose a zone-aware persistent deletion scheme for key-value store engines. Targeting mitigating the write amplification induced by level compaction, we design an adaptive SSTable selection strategy for each level in the LSM tree. Additionally, as the SSTable with deletion records would become invalid after the persistent deletion timer reaches its threshold, we design a tombstone-aware zone allocation strategy to reduce the data migration induced by garbage collection. In further, we optimize the victim zone selection in GC to reduce the invalid migration of tombstone files. Experimental results demonstrate that our scheme effectively ensures that most outdated physical versions are deleted before reaching the persistent deletion time threshold. When deleting 10% of keys in the key-value store engine, this scheme reduces write amplification by 74.7% and the garbage collection-induced write by 87.3% compared to the Lethe-Fade scheme.
引用
收藏
页数:10
相关论文
共 34 条
  • [1] Athanassoulis M., 2022, A Quarterly bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering, V45
  • [2] Bjorling M, 2021, PROCEEDINGS OF THE 2021 USENIX ANNUAL TECHNICAL CONFERENCE, P689
  • [3] Duplicates also Matter! Towards Secure Deletion on Flash-based Storage Media by Removing Duplicates
    Chen, Niusen
    Chen, Bo
    [J]. ASIA CCS'22: PROCEEDINGS OF THE 2022 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2022, : 54 - 66
  • [4] A Fast Secure Deletion Strategy for High-Density Flash Memory through WOM-v Codes
    Cui, Jinhua
    Tang, Kai
    Yang, Laurence T.
    [J]. 2023 60TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, DAC, 2023,
  • [5] ADS: Leveraging Approximate Data for Efficient Data Sanitization in SSDs
    Cui, Jinhua
    Liu, Weiguang
    Huang, Jianhang
    Yang, Laurence T.
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2022, 41 (06) : 1771 - 1784
  • [6] RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications
    Dong, Siying
    Kryczka, Andrew
    Jin, Yanqin
    Stumm, Michael
    [J]. ACM TRANSACTIONS ON STORAGE, 2021, 17 (04)
  • [7] Geambasu R, 2009, USENIX SEC S, V316, P10
  • [8] Han K, 2021, PROCEEDINGS OF THE 15TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDI '21), P147
  • [9] Ho C.-C., 2023, IEEE Trans. Comput.
  • [10] SplitZNS: Towards an Efficient LSM-Tree on Zoned Namespace SSDs
    Huang, Dong
    Feng, Dan
    Liu, Qiankun
    Ding, Bo
    Zhao, Wei
    Wei, Xueliang
    Tong, Wei
    [J]. ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2023, 20 (03)