An Efficient Dynamic Hash Index Structure for NAND Flash Memory

Abstract

We propose an efficient dynamic hash index structure suitable for a NAND flash memory environment. Since write operations incur significant overhead in NAND flash memory, our design of index structure focuses on minimizing the number of write operations for hash index up dates. Through a set of extensive experiments, we show the effectiveness of the proposed hash index structure in a NAND flash memory environment.