Home
>
Explore Content
>
All Issues
>
Article View
Index Management Method using Page Mapping Log in B⁺-Tree based on NAND Flash Memory
Journal of The Korea Society of Computer and Information
Abbr :
JKSCI
2015, 20(5), pp.1-12
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
2015, 20(5), pp.1-12
Publisher : The Korean Society Of Computer And Information
Research Area : Computer Science
-
NAND flash memory has being used for storage systems widely, because it has good features which are low-price, low-power and fast access speed. However, NAND flash memory has an in-place update problem, and therefore it needs FTL(flash translation layer) to run for applications based on hard disk storage. The FTL includes complex functions, such as address mapping, garbage collection, wear leveling and so on. Futhermore, implementation of the FTL on low-power embedded systems is difficult due to its memory requirements and operation overhead. Accordingly, many index data structures for NAND flash memory have being studied for the embedded systems. Overall performances of the index data structures are enhanced by a decreasing of page write counts, whereas it has increased page read counts, as a side effect. Therefore, we propose an index management method using a page mapping log table in B.-Tree based on NAND flash memory to decrease page write counts and not to increase page read counts. The page mapping log table registers page address information of changed index node and then it is exploited when retrieving records. In our experiment, the proposed method reduces the page read counts about 61% at maximum and the page write counts about 31% at maximum, compared to the related studies of index data structures.
131
Viewed
Print this page
Download PDF