A Novel Overflowing Mechanism for B-tree Index on Flash Memory

Abstract

Recently, flash memory has been widely used because of its advantages such as fast access speed, nonvolatile, low power consumption. However, erasebefore-write feature causes the B-tree implementation on flash memory to be inefficient because it generates many flash operations. This study introduces a novel overflowing mechanism for B-tree index, called OMB. It can reduce the number of flash operations and minimize the number of pages used to store the B-tree index. The experimental results show that OMB yields a good performance and save a lot of flash memory resources.