(18.206.187.91) 您好!臺灣時間:2021/05/19 01:44
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:楊宗哲
研究生(外文):YANG,ZONG-ZHE
論文名稱:基於LSM-tree鍵值儲存之快速資料抹除設計
論文名稱(外文):Enabling Fast Sanitization on Log-Structure-Merge tree Key-Value Store
指導教授:何建忠何建忠引用關係
指導教授(外文):HO, ‪CHIEN-CHUNG
口試委員:涂嘉恆張育銘
口試委員(外文):TU, CHIA-HENGCHANG, YU-MING
口試日期:2020-07-31
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2020
畢業學年度:109
語文別:中文
論文頁數:36
中文關鍵詞:鍵值儲存日誌結構合併樹資料刪除
外文關鍵詞:Key-Value StoreLog-Structured Merge TreeData Erasure
相關次數:
  • 被引用被引用:0
  • 點閱點閱:50
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
日誌結構合併樹鍵值資料庫已經成為常被應用在各種務聯網中儲存資料庫的主要選擇,為了應對各種挑戰,已經有許多的技術克服了日誌結構合併樹本身的限制以及提高它整體的效能。在儲存裝置中暫存的個人資訊不斷增加的情況下,資料安全儼然成為了一個逐漸被大家重視的議題。為了有效的減少資料庫中不必要的存取,之前提出的研究方法都著重在寫入放大問題等跟運算效能有關的議題,但是他們並沒有探討如何保護這些個資。因此我們進一步地去觀察刪除指令下達後日誌結構合併樹中資料殘留的情況,並且利用覆寫加密金鑰的方式來達到資料抹除。本論文透過觀察提出了FSKV,先分析因out-place-update以及日誌結構合併樹中壓縮(compaction)操作對裝置所造成的影響後,進一步加密金鑰本身的特性實現更快速的資料抹除。最後我們將本論文提出兩個資料抹除方法與日誌合併結構樹中傳統的做法比較。實驗表明,跟傳統做法相比,我們的資料抹除指令平均可以減少99%的響應時間。
摘要 i
目錄 ii
圖目錄 iii
表目錄 v
一、緒論及相關研究 1
二、背景&動機 8
2-1 背景 8
2-2 動機 13
三、Fast Sanitization on Key Value store (FSKV) design 15
3-1 概要 15
3-2 FSKV 16
3-3 鍵值對的大小對查找以及資料抹除的影響 23
3-4 FSKV-inverse 24
四、實驗結果 28
4-1 實驗平台 28
4-2 實驗結果 29
五、結論 33
參考文獻 34


[1]Lu, Lanyue, et al. "Wisckey: Separating keys from values in ssd-conscious storage." ACM Transactions on Storage (TOS) 13.1 (2017): 1-28..
[2]Chan, Helen HW, et al. "HashKV: Enabling Efficient Updates in {KV} Storage via Hashing." 2018 {USENIX} Annual Technical Conference ({USENIX}{ATC} 18). 2018.
[3]Yao, Ting, et al. "A light-weight compaction tree to reduce I/O amplification toward efficient key-value stores." Proceedings of the 33rd International Conference on Massive Storage Systems and Technology (MSST 2017). 2017.
[4]Raju, Pandian, et al. "Pebblesdb: Building key-value stores using fragmented log-structured merge trees." Proceedings of the 26th Symposium on Operating Systems Principles. 2017.
[5]Mei, Fei, et al. "LSM-tree managed storage for large-scale key-value store." IEEE Transactions on Parallel and Distributed Systems 30.2 (2018): 400-414.
[6]Pan, Fengfeng, Yinliang Yue, and Jin Xiong. "dCompaction: Delayed compaction for the LSM-tree." International Journal of Parallel Programming 45.6 (2017): 1310-1325.
[7]Balmau, Oana, et al. "{SILK}: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores." 2019 {USENIX} Annual Technical Conference ({USENIX}{ATC} 19). 2019.
[8]Dayan, Niv, and Stratos Idreos. "Dostoevsky: Better space-time trade-offs for LSM-tree based key-value stores via adaptive removal of superfluous merging." Proceedings of the 2018 International Conference on Management of Data. 2018.
[9]Teng, Dejun, et al. "LSbM-tree: Re-enabling buffer caching in data management for mixed reads and writes." 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). IEEE, 2017.
[10]Kumar, P. Ravi, P. Herbert Raj, and P. Jelciana. "Exploring data security issues and solutions in cloud computing." Procedia Computer Science 125 (2018): 691-697.
[11]Zhang, Jiale, et al. "Data security and privacy-preserving in edge computing paradigm: Survey and open issues." IEEE Access 6 (2018): 18209-18237.
[12]Jiang, Feng, et al. "Deep learning based multi-channel intelligent attack detection for data security." IEEE transactions on Sustainable Computing (2018).
[13]Li, Bingzhe, and David HC Du. "Tasecure: Temperature-aware secure deletion scheme for solid state drives." Proceedings of the 2019 on Great Lakes Symposium on VLSI. 2019.
[14]Wang, Wei-Chen, et al. "Scrubbing-aware secure deletion for 3-d nand flash." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37.11 (2018): 2790-2801.
[15]Lin, Ping-Hsien, et al. "Achieving fast sanitization with zero live data copy for MLC flash memory." 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2018.
[16]Xiao, Tianran, et al. "Per-File Secure Deletion for Flash-Based Solid State Drives." 2019 IEEE International Conference on Networking, Architecture and Storage (NAS). IEEE, 2019.
[17]Peterson, Zachary NJ, et al. "Secure Deletion for a Versioning File System." FAST. Vol. 5. No. 2005. 2005.
[18]Cai, Zhipeng, et al. "Collective data-sanitization for preventing sensitive information inference attacks in social networks." IEEE Transactions on Dependable and Secure Computing 15.4 (2016): 577-590.
[19]Hong, Tzung-Pei, et al. "A heuristic data-sanitization approach based on TF-IDF." International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer, Berlin, Heidelberg, 2011.
[20]Lin, Jerry Chun-Wei, et al. "A sanitization approach to secure shared data in an iot environment." IEEE Access 7 (2019): 25359-25368.
[21]Garfinkel, Simson L., and Abhi Shelat. "Remembrance of data passed: A study of disk sanitization practices." IEEE Security & Privacy 1.1 (2003): 17-27.
[22]Bailleu, Maurice, et al. "{SPEICHER}: Securing LSM-based Key-Value Stores using Shielded Execution." 17th {USENIX} Conference on File and Storage Technologies ({FAST} 19). 2019.
[23]https://github.com/google/leveldb
[24]https://en.wikipedia.org/wiki/Advanced_Encryption_Standard
[25]https://github.com/intel/isa-l_crypto

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top