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

Author

Bo-kyeong Kim ; Chang-Jun Yeo ; Dong-Ho Lee

Author_Institution

Dept. of Comput. Sci. & Eng., Hanyang Univ., Ansan, South Korea

fYear

2014

fDate

15-18 Jan. 2014

Firstpage

1

Lastpage

2

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.

Keywords

NAND circuits; flash memories; tree data structures; trees (mathematics); B-tree; NAND flash SSD array; cascade memory node; power consumption; storage device; Arrays; Degradation; Flash memories; Indexes; Memory management; Performance evaluation; Power demand; B-tree; Index Structure; NAND Flash; SSD;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics, Information and Communications (ICEIC), 2014 International Conference on

Conference_Location

Kota Kinabalu

Type

conf

DOI

10.1109/ELINFOCOM.2014.6914424

Filename

6914424