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

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

0

초록

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.

키워드

B-tree; Index Structure; NAND Flash; SSD; Batch data processing; Trees (mathematics); Virtual storage; In-place update; Index structure; Low-power consumption; NAND Flash; Nand flash arrays; Performance degradation; SSD; Write operations; Flash-based SSDs
제목
A B-tree employing a cascade memory node on NAND flash SSDs
저자
Kim, Bo kyeong; Yeo, Chang jun; Lee, Dong ho
DOI
10.1109/ELINFOCOM.2014.6914424
발행일
2014-01
유형
Conference Paper
저널명
13th International Conference on Electronics, Information, and Communication, ICEIC 2014 - Proceedings