Dynamic Forest: An Efficient Index Structure for NAND Flash Memory

Chul-Woong YANG  Ki YONG LEE  Myoung HO KIM  Yoon-Joon LEE  

IEICE TRANSACTIONS on Information and Systems   Vol.E92-D   No.5   pp.1181-1185
Publication Date: 2009/05/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E92.D.1181
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Database
NAND flash memory,  D-Forest,  index structure,  

Full Text: PDF>>
Buy this Article

In this paper, we present an efficient index structure for NAND flash memory, called the Dynamic Forest (D-Forest). Since write operations incur high overhead on NAND flash memory, D-Forest is designed to minimize write operations for index updates. The experimental results show that D-Forest significantly reduces write operations compared to the conventional B+-tree.