NAND 플래시 메모리용 B+트리의 인덱스 버퍼를 위한 효율적인 고장회복 관리기법

An Efficient Recovery Management Scheme for an Index Buffer of B+tree based on NAND Flash Memory
  • 이현섭; 
  • 김보경; 
  • 주영도; 
  • 이동호

초록

Recently, NAND flash memory has been remarked as a best medium of the next generation storage because of its fast speed and low power consumption. Therefore, in various computing systems, the HDD (hard disk drive) has been replaced by the SSD (NAND flash-based solid state disk). However, since the SSD inherits the limitations of NAND flash memory such as erase-before-write architecture and asymmetric read/write speeds, it may result in severe performance degradation when building a B-tree that causes intensive writes at the same location. To reduce the cost of a B-tree implementation, several methods exploiting the buffer have been proposed so far. However, they have the recovery problem because all index data in the buffer are eliminated when power-failure occurs. In this paper, we introduce an efficient recovery management scheme for an index buffer of B-tree based on NAND flash memory for solving the recovery problem. Since the proposed method flushes all index data in the buffer into the SSD and creates the checkpoint whenever updating the root node, it can always recover the index structure into the last commit time. Also, it adopts the shadow-paging strategy for reducing the number of overwrites when committing the node. This method may reduce the time of recovery because it can eliminate a number of writes during the recovery. Consequently, it can efficiently reduce not only the consumed time but also the time of recovery when constructing a B-tree on SSD. We also show that our proposed algorithm yields a good performance on the SSD by comparing it to the related technique through various experiments.

키워드

플래시 메모리; B트리; 버퍼 관리 기법; 고장 회복; 색인 버퍼; 색인 단위; Flash Memory; B-tree; Buffer Management Scheme; Recovery; Index Buffer; Index Unit
제목
NAND 플래시 메모리용 B+트리의 인덱스 버퍼를 위한 효율적인 고장회복 관리기법
제목 (타언어)
An Efficient Recovery Management Scheme for an Index Buffer of B+tree based on NAND Flash Memory
저자
이현섭; 김보경; 주영도; 이동호
발행일
2011-12
저널명
데이타베이스연구
권
27
호
3
페이지
19 ~ 41