원문정보
초록
영어
Recent advancement in mobile miniature information equipment has led to a rapid growth in the usage of storage device based on flash memory. Also, Flash memory is being used as the next generation’s storing device and shows rapid growth in massive storage device such as the SSD due to the distinguishable features such as low power consumption, strong durability, approach velocity, non-vibration, non-noise etc. These Flash drives uses B+-Tree index universally. However, B+-tree index has a flaw which downgrades the performance due to the repetitive writing request caused by the insertion of node. This dissertation suggested the F-ISLD (F-Tree Index Segment Log Directory) method which uses the F-Tree index. To prove the method’s superiority the suggested method and BISLD (B+-Tree Index Segment Log Directory) was compared. According to the assessment, the overall performance was increased by 29%.
목차
1. Introduction
2. Related Research
2.1. NAND Flash Memory’s B+-Tree Index Buffer Recovery Method
2.2. IBSF Techniques
2.3. MR-Tree Technique
2.4. Crashed Flash File Restoration Technique
3. Technique in Restoring Damaged Flash Memory Base through F-Tree
3.1. F-Tree Index System Structure
3.2. F-Tree Index Algorithm
4. Performance Evaluation
4.1. Experiment Result and Analysis
5. Conclusion
References