@article{ART002000402},
author={Seon Hwan Kim and Jong Wook Kwak},
title={Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2015},
volume={20},
number={6},
pages={1-11}
TY - JOUR
AU - Seon Hwan Kim
AU - Jong Wook Kwak
TI - Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory
JO - Journal of The Korea Society of Computer and Information
PY - 2015
VL - 20
IS - 6
PB - The Korean Society Of Computer And Information
SP - 1
EP - 11
SN - 1598-849X
AB - Recently, NAND flash memories are used for storage devices because of fast access speed and low-power. However, applications of FTL on low power computing devices lead to heavy workloads which result in a memory requirement and an implementation overhead. Consequently, studies of B+-Tree on embedded devices without the FTL have been proposed. The studies of B+-Tree are optimized for performance of inserting and updating records, considering to disadvantages of the NAND flash memory that it can not support in-place update. However, if a general garbage collection method is applied to the previous studies of B+-Tree, a performance of the B+-Tree is reduced, because it generates a rearrangement of the B+-Tree by changing of page positions on the NAND flash memory. Therefor, we propose a novel garbage collection method which can apply to the B+-Tree based on the NAND flash memory without the FTL. The proposed garbage collection method does not generate a rearrangement of the B+-Tree by using a block information table and a proxy block. We implemented the B+-Tree and μ -Tree with the proposed garbage collection on physical devices with the NAND flash memory. In experiment results, the proposed garbage collection scheme compared to greedy algorithm garbage collection scheme increased the number of inserted keys by up to about 73% on B+-Tree and decreased elapsed time of garbage collection by up to about 39% on μ-Tree.
KW - Flash memory;B+-Tree;Garbage collection;Storage system;Index data structure
DO -
UR -
ER -
Seon Hwan Kim and Jong Wook Kwak. (2015). Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory. Journal of The Korea Society of Computer and Information, 20(6), 1-11.
Seon Hwan Kim and Jong Wook Kwak. 2015, "Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory", Journal of The Korea Society of Computer and Information, vol.20, no.6 pp.1-11.
Seon Hwan Kim, Jong Wook Kwak "Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory" Journal of The Korea Society of Computer and Information 20.6 pp.1-11 (2015) : 1.
Seon Hwan Kim, Jong Wook Kwak. Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory. 2015; 20(6), 1-11.
Seon Hwan Kim and Jong Wook Kwak. "Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory" Journal of The Korea Society of Computer and Information 20, no.6 (2015) : 1-11.
Seon Hwan Kim; Jong Wook Kwak. Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory. Journal of The Korea Society of Computer and Information, 20(6), 1-11.
Seon Hwan Kim; Jong Wook Kwak. Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory. Journal of The Korea Society of Computer and Information. 2015; 20(6) 1-11.
Seon Hwan Kim, Jong Wook Kwak. Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory. 2015; 20(6), 1-11.
Seon Hwan Kim and Jong Wook Kwak. "Garbage CollectionMethod using Proxy Block considering Index Data Structure based on Flash Memory" Journal of The Korea Society of Computer and Information 20, no.6 (2015) : 1-11.
