분할상태목록을 이용한 NAND 플래시 메모리를 위한 선형 해시 인덱스

A Linear Hash Index for NAND Flash Memory using Split State Table

초록

Recently, NAND Flash memory has become an alternative popular storage system for a nextgeneration storage device because of its rapid access speed, shock-resistant, small size and lower power consumption. However, NAND Flash memory has several hardware limitations such as asymmetric read, write, erase operation speed and no in-place update so that hash index structure, one of the most popular disk-based index structure, may result in severe performance degradation when directly implementing them on NAND Flash memory because of additional read, write, erase operation by overflow chain. Although New Dynamic Hash has been proposed in order to overcome this problem, it requires more than one bucket to search for a key. Also it still does not solve the problems such as additional read, write and erase operations generated by overflow chain. In this paper, we propose a novel flash-aware Linear Hash index structure(LHF) that uses Split State Table instead of overflow chain when a bucket overflow occurs. LHF using Split State Table does not generate additional erase operations by overflow chain and guarantees fast search speed because it retrieves only one bucket during the search operation. Finally, we show that LHF yields a better performance on NAND Flash memory by comparing it to disk-based Linear Hash and New Dynamic Hash through various experiments.

키워드

NAND Flash Memory; Hash Index; Linear Hash; Split State Table; NAND 플래시 메모리; 해시 인덱스; 선형 해시; 분할상태목록
제목
분할상태목록을 이용한 NAND 플래시 메모리를 위한 선형 해시 인덱스
제목 (타언어)
A Linear Hash Index for NAND Flash Memory using Split State Table
저자
정영웅; 주영도; 이동호
발행일
2009-12
저널명
데이타베이스연구
권
25
호
3
페이지
131 ~ 142