Next Article in Journal
The Asymmetry is Derived from Mechanical Interlocking of Achiral Axle and Achiral Ring Components –Syntheses and Properties of Optically Pure [2]Rotaxanes–
Previous Article in Journal
Efficient Information Hiding Based on Theory of Numbers
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(1), 18; doi:10.3390/sym10010018

WPCB-Tree: A Novel Flash-Aware B-Tree Index Using a Write Pattern Converter

1
Department of Computer Science, Korea - Vietnam Friendship Information Technology College, Da Nang 550000, Vietnam
2
School of Computer Science and Engineering, Soongsil University, Seoul 06978, Korea
*
Author to whom correspondence should be addressed.
Received: 23 October 2017 / Revised: 30 December 2017 / Accepted: 3 January 2018 / Published: 8 January 2018
View Full-Text   |   Download PDF [3124 KB, uploaded 16 January 2018]   |  

Abstract

For the past few years, flash memory has been widely used because of its prominent advantages such as fast access speed, nonvolatility, high reliability, and low power consumption. However, flash memory still has several drawbacks that need to be overcome, e.g., the erase-before-write characteristic and a limited life cycle. Among these drawbacks, the erase-before-write characteristic causes the B-tree implementation on flash memory to be inefficient because it generates many erase operations. This study introduces a novel B-tree index structure using a write pattern converter (WPCB-tree) for flash memory. A WPCB-tree can minimize the risk of data loss and can improve the performance of the B-tree on flash memory. This WPCB-tree uses some blocks of flash memory as a buffer that temporarily stores all updated nodes. When the buffer is full, a buffer block is selected by a greedy algorithm, then the node pages in the block are converted into a sequential write pattern, and finally they are written into flash memory. In addition, in the case that all key values of a leaf node are continuously inserted, the WPCB-tree does not split the leaf node. As a result, this mechanism helps the WPCB-tree reduce the number of write operations on the flash memory. The experimental results show that the proposed B-tree variant on flash memory yields a better performance than that of other existing variants of the B-tree. View Full-Text
Keywords: B-tree index; flash-aware index; pattern conversion; flash memory B-tree index; flash-aware index; pattern conversion; flash memory
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Ho, V.P.; Park, D.-J. WPCB-Tree: A Novel Flash-Aware B-Tree Index Using a Write Pattern Converter. Symmetry 2018, 10, 18.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top