A flash-friendly B+-tree with endurance-awareness

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

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

3 Citations (Scopus)

Abstract

This work is motivated by the strong demands of flash-friendly index designs to resolve reliability and performance concerns for data manipulations over flash memory. Different from the past work, we propose and explore the impacts of hot-data access and sibling-link updates to a tree index structure over flash memory. In particular, a flash-friendly B+-tree, referred to as a Durable B+-tree, is proposed to not only improve the endurance but also the performance of a tree index structure over flash memory. The capability of the proposed methodology and index design was evaluated by a series of experiments, in which significant improvement on endurance was achieved, compared with the past work. 
Original languageEnglish
Title of host publication2011 9th IEEE Symposium on Embedded Systems for Real-Time Multimedia
PublisherIEEE
Pages29-36
ISBN (Electronic)9781457721229
ISBN (Print)9781457721236
DOIs
Publication statusPublished - Oct 2011
Externally publishedYes
Event9th IEEE Symposium on Embedded Systems for Real-Time Multimedia (ESTIMedia 2011) - Taipei, Taiwan
Duration: 13 Oct 201114 Oct 2011

Publication series

NameIEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia
ISSN (Print)2325-1271
ISSN (Electronic)2325-1301

Conference

Conference9th IEEE Symposium on Embedded Systems for Real-Time Multimedia (ESTIMedia 2011)
Abbreviated titleESTIMedia 2011
Country/TerritoryTaiwan
CityTaipei
Period13/10/1114/10/11

Research Keywords

  • B-Tree
  • Endurance
  • Flash-memory Storage Systems
  • Index Structure
  • Reliability

Fingerprint

Dive into the research topics of 'A flash-friendly B+-tree with endurance-awareness'. Together they form a unique fingerprint.

Cite this