A B-tree employing a cascade memory node on NAND flash SSDs

Abstract

A NAND flash SSD has been widely used as a storage device because of its fast access speed and low power consumption. It inherits distinctive features such as no in-place update because it consists of NAND flash arrays. When implementing a B-tree on flash SSDs, the performance degradation occurs due to intensive updates in the same node. In this paper, we propose a B-tree employing a cascade memory node on NAND flash SSDs in order to reduce intensive overwrites. Our B-tree keeps the modified data so as to delay write operations and performs the flushing of memory node in batch process. Through the experiment, we show the superiority of our B-tree compared to related techniques. © 2014 IEEE.