$\mu$-Tree : an efficient index structure for NAND flash memory

Abstract

As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management systems are being built on it. They require an efficient index structure to locate a particular item quickly from a huge amount of directory entries or database records. This paper proposes $\mu$-Tree, a new ordered index structure tailored to the characteristics of NAND flash memory. $\mu$-Tree is a balanced tree similar to $B^+$ -Tree. In $\mu$-Tree, however, all the nodes along the path from the root to the leaf are put together into a single flash memory page in order to minimize the number of flash write operations when a leaf node is updated. Our experimental evaluation shows that $\mu$-Tree outperforms $B^+$ -Tree by up to 78\% for traces extracted from real workloads.