플래시 메모리상에 B+트리를 위한 효율적인 색인 버퍼 관리 정책

An Efficient Index Buffer Management Scheme for a B+tree on Flash Memory

초록

Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.

키워드

플래시 메모리; B트리; 버퍼 관리 기법; 플래시 전환 계층; 색인 버퍼; 색인 단위; Flash Memory; B-tree; Buffer Management Scheme; Flash Translation Layer; Index Buffer; Index Unit
제목
플래시 메모리상에 B+트리를 위한 효율적인 색인 버퍼 관리 정책
제목 (타언어)
An Efficient Index Buffer Management Scheme for a B+tree on Flash Memory
저자
이현섭; 주영도; 이동호
발행일
2007-12
저널명
정보처리학회논문지D
권
14
호
7
페이지
719 ~ 726