μ*-Tree : an index structure for nand flash memory with adaptive page layout schemeμ*-트리 : 적응적인 페이지 구획 기법을 사용하는 낸드 플래시 색인 구조

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 818
  • Download : 0
As increasing the usage of NAND flash memory, many file systems or DBMSs are built on it. They need index structure such as $B^+$ -Tree to manage matadata or indexing information. $B^+$ -Tree is the most popular index structure, but it is not efficient in NAND flash memory. To overcome the problems of $B^+$ -Tree, $\mu$-Tree was proposed. However, the page utilization of $\mu$-Tree is always half of that of $B^+$ -Tree because of its page layout. This paper proposes $\mu^*$-Tree, which is an improved version of $\mu$-Tree. $\mu*$-Tree has generalized layout, thus the page utilization can be configured according to characteristics of workloads. Furthermore, $\mu^*$-Tree has an adaptive layout scheme, which dynamically adjusts page layout of $\mu^*$-Tree according to I/O pattern on-the-fly. The adaptive scheme helps to configure $\mu^*$-Tree to have better performance automatically. Our evaluation results show that $\mu^*$-Tree outperforms the original $\mu$-Tree by up to 25% and $B^+$-Tree by up to 55% in real workload results.
Advisors
Maeng, Seung-Ryoulresearcher맹승렬researcher
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
419100/325007  / 020083277
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2010.2, [ vi, 41 p. ]

Keywords

B-tree; index structure; NAND flash memory; μ-tree; μ-트리; B-트리; 색인 구조; 낸드 플래시 메모리

URI
http://hdl.handle.net/10203/34895
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=419100&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0