An improved B+ tree for flash file systems

Authors:
Ferenc Havasi
Affiliations:
Department of Software Engineering, University of Szeged, Szeged, Hungary
Venue:
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Year:
2011

Citing 4
Cited 0

Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
An efficient B-tree layer implementation for flash-memory storage systems

ACM Transactions on Embedded Computing Systems (TECS)
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory

ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Lazy-Update B+-Tree for Flash Devices

MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nowadays mobile devices such as mobile phones, mp3 players and PDAs are becoming evermore common. Most of them use flash chips as storage. To store data efficiently on flash, it is necessary to adapt ordinary file systems because they are designed for use on hard disks. Most of the file systems use some kind of search tree to store index information, which is very important from a performance aspect. Here we improved the B+ search tree algorithm so as to make flash devices more efficient. Our implementation of this solution saves 98%-99% of the flash operations, and is now the part of the Linux kernel.