arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.1114cs.DS
收藏

一种持久的闪存搜索树

A Durable Flash Memory Search Tree

James Clay, Kevin Wortman

摘要:

我们认为,优化的B-树数据结构,广泛用于操作系统和数据库,可持续使用的多级闪存的任务。经验证据表明,这种新的闪存树或FM树将每个闪存块的操作寿命延长了大约27到70倍,同时仍然支持并行时间搜索树操作。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑