关键词: 闪存数据库, 索引结构, 缓冲更新, 自适应机制, 代价评估

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.

Key words: flash-based database, index structure, delayed update, self-adaptive mechanism, cost estimate