Index structure with self-adaptive mechanism in flash-based database system

Abstract

The log-based index update mechanism in flash-based database system has following shortage:low query efficiency,expensive update cost,unreasonable space allocation and merge for the log.In order to solve these problems,a new adaptive index structure named LM-B+TREE was proposed.LM-B+TREE can map the page for index update buffer into corresponding node of traditional B+ TREE.Furthermore,according to the read/write workload and read/write overhead,LM-B+TREE can dynamically maintain the update buffer and adjust the index frame adaptively.The experimental results show that LM-B+ TREE can dynamically adjust the index structure to adapt to the read-write workload,significantly reduce the overhead of index update and improve the query performance.