An Adaptive Endurance-Aware B+-Tree for Flash Memory Storage Systems

Hua-Wei Fang, Mi-Yen Yeh, Pei-Lun Suei, Tei-Wei Kuo

Abstract

This work is motivated by the strong demand for flash-friendly index designs to resolve reliability and performance concerns for data manipulation over flash memory. In comparison to previous work, we propose and explore the impact of hot-data access, sibling-link updates, and different workload types to a tree index structure over flash memory. In particular, a flash-friendly <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${B^ + }$</tex> </formula> -tree, referred to as an Adaptive Durable <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex Notation="TeX">${B^ + }$</tex> </formula> -tree, is proposed to not only improve the endurance but also the performance of a tree index structure. The capability of the proposed methodology and index design is evaluated through a series of experiments, in which significant improvement on endurance was achieved in comparison to previous reports on the subject.
BibTeX
@article{fang2014adaptive,
  author = {Hua-Wei Fang and Mi-Yen Yeh and Pei-Lun Suei and Tei-Wei Kuo},
  title = {{An Adaptive Endurance-Aware B+-Tree for Flash Memory Storage Systems}},
  journal = {IEEE Trans. Computers},
  year = {2014},
  doi = {10.1109/tc.2013.158},
}

Loading related content...

Figure