earticle

영어

Recently, flash memory has been widely used as it has strong points, such as high-speed access, low power consumption, high density and shock resistance. However, due to its hardware characteristics, specifically its erase-before-write feature, it is inefficient for deploying directly B+-tree index which produces a lot of write operations in random order when its nodes are updated. Thus, the normal B+-Tree structure is unfavorable for use in flash memory. Several variants of B+-tree have been proposed for flash memory so far. This paper surveys the state-of-the-art B+-tree index variants on flash memory that have been presented in conference proceedings and journals. It provides a broad overview of existing schemes, algorithms to solve them, and discusses related research issues.