An Efficient B-Tree Layer for Flash-Memory Storage Systems
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
2968
Pages
409-430
Date Issued
2003
Date
2004
Author(s)
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. © Springer-Verlag 2004.
Subjects
B-Tree; Database Systems; Embedded Systems; Flash Memory; Storage Systems
Other Subjects
Consumer electronics; Database systems; Embedded systems; Energy dissipation; Monolithic microwave integrated circuits; Real time systems; Trees (mathematics); Application systems; B trees; Economic solutions; Flash memory storage systems; Flash translation layer; Index structure; Memory management; Storage systems; Flash memory
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
50.pdf
Size
23.19 KB
Format
Adobe PDF
Checksum
(MD5):98cdef74915246fdc99ebcf1b3923a82