A Durable Flash Memory Search Tree
Data Structures and Algorithms
2012-05-08 v1
Abstract
We consider the task of optimizing the B-tree data structure, used extensively in operating systems and databases, for sustainable usage on multi-level flash memory. Empirical evidence shows that this new flash memory tree, or FM Tree, extends the operational lifespan of each block of flash memory by a factor of roughly 27 to 70 times, while still supporting logarithmic-time search tree operations.
Keywords
Cite
@article{arxiv.1205.1114,
title = {A Durable Flash Memory Search Tree},
author = {James Clay and Kevin Wortman},
journal= {arXiv preprint arXiv:1205.1114},
year = {2012}
}
Comments
This is a 2 Page abstract submitted to CompSust'12