A reliable B-tree implementation over flash memory

Authors:
Xiaoyan Xiang;Lihua Yue;Zhanzhan Liu;Peng Wei
Affiliations:
University of Science and Technology of China, Hefei, P.R.China;University of Science and Technology of China, Hefei, P.R.China;University of Science and Technology of China, Hefei, P.R.China;University of Science and Technology of China, Hefei, P.R.China
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 3
Cited 4

A general solution of the n-dimensional B-tree problem

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
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

An adaptive block-set based management for large-scale flash memory

Proceedings of the 2009 ACM symposium on Applied Computing
AD-LRU: An efficient buffer replacement algorithm for flash-based databases

Data & Knowledge Engineering
Update migration: an efficient B+ tree for flash storage

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
h-Buffer: an adaptive buffer management scheme for flash-based storage devices

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flash memory has been widely used in various embedded computing systems and portable devices in recent years because of its small size, shock-resistance, low-power consumption and non-volatile properties. To hide the disadvantages of flash memory such as out-of-place update, a flash translation layer (FTL) is usually used for providing transparent block-device emulation. But when index structures are implemented over FTL, intensive overwrite operations caused by record inserting, deleting, modifying and index reorganizing could not only degrade the performance significantly but also reduce the life of flash memory. To address the problem, BFTL and IBSF are proposed. However, neither of them could avoid the loss of records and incompatibilities when system crash occurs. In this paper, a reliable B-tree implementation called RBFTL is presented for flash-memory storage systems. It is placed between the application layer and FTL. RBFTL could minimize the loss of data and eliminate incompatibilities effectively and efficiently when system crashes. The experimental results also show that RBFTL yields a better performance than FTL.