상세 보기
NAND 플래시 메모리를 위한 로그 기반의 B-트리
- 김보경;
- 주영도;
- 이동호
초록
Recently, NAND flash memory is becoming into the spotlight as a next-generation storage device because of its small size, fast speed, low power consumption, and etc. compared to the hard disk. However, due to the distinct characteristics such as erase-before-write architecture, asymmetric operation speed and unit, disk-based systems and applications may result in severe performance degradation when directly implementing them on NAND flash memory. Especially when a B-tree is implemented on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation. Although μ-tree has been proposed in order to overcome this problem, it suffers from frequent node split and rapid increment of its height. In this paper, we propose Log-Structured B-Tree(LSB-Tree) where the corresponding log node to a leaf node is allocated for update operation and then the modified data in the log node is stored at only one write operation. LSB-tree reduces additional write operations by deferring the change of parent nodes. Also, it reduces the write operation by switching a log node to a new leaf node when inserting the data sequentially by the key order. Finally, we show that LSB-tree yields a better performance on NAND flash memory by comparing it to μ-tree through various experiments.
키워드
- 제목
- NAND 플래시 메모리를 위한 로그 기반의 B-트리
- 제목 (타언어)
- Log-Structured B-Tree for NAND Flash Memory
- 저자
- 김보경; 주영도; 이동호
- 발행일
- 2008-12
- 저널명
- 정보처리학회논문지D
- 권
- 15
- 호
- 6
- 페이지
- 755 ~ 766
- 언어
- KOR
- 출판사
- 한국정보처리학회
- 발행국가
- 대한민국
- 분량
- 12 페이지
- ISSN
- P 1598-2866