원문정보
초록
영어
Unlike disk-based database, memory-based database mostly uses memories with small capacity and NAND flash memories for rapid data processing in low power battery environments. NAND flash memories are strong against physical shocks and have an advantage of rapid access speed, but it also has a shortcoming of functional deterioration due to a slow processing speed because of its structural impossibility of in-place-update. In order to solve such functional deterioration problem of NAND flash memories, the hybrid hash index technique, which minimizes split operations of overflow bucket using expanded hash index, is suggested. The technique immediately allocates overflow bucket as soon as split operation occurs, to solve the functional deterioration problem by reducing occurrence of additional operations. However, such technique also has a shortcoming of functional deterioration as it processes search or editing operations on additional overflow bucket in an order as it processes sequential files. Therefore, this study proposes a hybrid hash B+tree index technique of which the function has been enhanced by saving information of overflow bucket at B+tree index. Lastly this paper proves that the proposed technique is more favorable than the previous technique through experiments and analysis.
목차
1. Introduction
2. Relevant Studies
2.1. Circular Hashing Model [7]
2.2. Flash Memory-based B+tree for Effective Rage Search [8]
2.3. NAND Flash Memory-based Hybrid Hash Index [6]
3. HHB+tree Index with B+tree
3.1. Fundamental Idea
3.2. Insertion Operation
3.3. Deletion Operation
3.4. Search Operation
4. Performance Evaluation
4.1. Measuring the Test Performance
4.2. Comparition Analysis and Evaluation on Performance
5. Conclusion
References