Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A B-tree employing a cascade memory node on NAND flash SSDs
- Authors
- Kim, Bo kyeong; Yeo, Chang jun; Lee, Dong ho
- Issue Date
- Jan-2014
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- B-tree; Index Structure; NAND Flash; SSD
- Citation
- 13th International Conference on Electronics, Information, and Communication, ICEIC 2014 - Proceedings
- Indexed
- OTHER
- Journal Title
- 13th International Conference on Electronics, Information, and Communication, ICEIC 2014 - Proceedings
- 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.
- Files in This Item
- Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > DEPARTMENT OF ARTIFICIAL INTELLIGENCE > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Lee, Dong Ho
- ERICA 소프트웨어융합대학 (DEPARTMENT OF ARTIFICIAL INTELLIGENCE)