본문 바로가기
  • Home

CL-Tree: B+ tree for NAND Flash Memory using Cache Index List

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(4), pp.1-10
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Hwang Sang-Ho 1 Jong Wook Kwak 1

1영남대학교

Accredited

ABSTRACT

NAND flash systems require deletion operation and do not support in-place update, so the storage systems should use Flash Translation Layer (FTL). However, there are a lot of memory consumptions using mapping table in the FTL, so recently, many studies have been proposed to resolve mapping table overhead. These studies try to solve update propagation problem in the nand flash system which does not use mapping table. In this paper, we present a novel index structure, called CL-Tree(Cache List Tree), to solve the update propagation problem. The proposed index structure reduces write operations which occur for an update propagation, and it has a good performance for search operation because it uses multi-list structure. In experimental evaluation, we show that our scheme yields about 173% and 179% improvement in insertion speed and search speed, respectively, compared to traditional B+tree and other works.

Citation status

* References for papers published after 2022 are currently being built.

This paper was written with support from the National Research Foundation of Korea.