An efficient B-tree layer implementation for flash-memory storage systems

  • Authors:

  • Chin-Hsien Wu;Tei-Wei Kuo;Li Ping Chang

  • Affiliations:

  • National Taiwan University, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC;National Chiao-Tung University, Hsin Chu, Taiwan, ROC

  • Venue:
  • ACM Transactions on Embedded Computing Systems (TECS)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the significant growth of the markets for consumer electronics and various embedded systems, flash memory is now an economic solution for storage systems design. Because index structures require intensively fine-grained updates/modifications, block-oriented access over flash memory could introduce a significant number of redundant writes. This might not only severely degrade the overall performance, but also damage the reliability of flash memory. In this paper, we propose a very different approach, which can efficiently handle fine-grained updates/modifications caused by B-tree index access over flash memory. The implementation is done directly over the flash translation layer (FTL); hence, no modifications to existing application systems are needed. We demonstrate that when index structures are adopted over flash memory, the proposed methodology can significantly improve the system performance and, at the same time, reduce both the overhead of flash-memory management and the energy dissipation. The average response time of record insertions and deletions was also significantly reduced.