Title: An efficient B-tree layer implementation for flash-memory storage systems
Authors: Wu, Chin-Hsien
Kuo, Tei-Wei
Chang, Li Ping
資訊工程學系
Department of Computer Science
Keywords: design;performance;algorithm;flash memory;B-tree;storage systems;embedded systems;database systems
Issue Date: 2007
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.
URI: http://hdl.handle.net/11536/11262
http://dx.doi.org/10.1145/1275986.1275991
ISSN: 1539-9087
DOI: 10.1145/1275986.1275991
Journal: ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS
Volume: 6
Issue: 3
Appears in Collections:Articles


Files in This Item:

  1. 000256880500005.pdf