Paper Info
Title
An Efficient B-Tree Layer for Flash-Memory Storage Systems
Abstract
With a significant growth of the markets for consumer electronics and various embedded systems, flash memory is now an economic solution for storage systems design. For index structures which require intensively fine-grained updates/modifications, block-oriented access over flash memory could introduce a significant number of redundant writes. It 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 could 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) such that no modifications to existing application systems are needed. We demonstrate that the proposed methodology could significantly improve the system performance and, at the same time, reduce the overheads of flash-memory management and the energy dissipation, when index structures are adopted over flash memory.
Year
DOI
Venue
2003
10.1007/978-3-540-24686-2_26
Lecture Notes in Computer Science
Keywords
Field
DocType
flash memory,B-tree,storage systems,embedded systems,database systems.
Flash file system,Flash memory,Dissipation,Simulation,Computer science,B-tree,Systems design,Universal memory,Memory management,Electronics,Distributed computing,Embedded system
Conference
Volume
ISSN
Citations 
2968
0302-9743
63
PageRank 
References 
Authors
10.47
10
3
Name
Order
Citations
PageRank
Chin-Hsien Wu141947.93
Li-Pin Chang296995.90
Tei-Wei Kuo33203326.35