【摘要】 内存数据库将数据存储在内存中进行操作,与基于磁盘的数据库相比在性能上得到提升,但是由于MMDB与DRDB的性能瓶颈的差异,用于DRDB的B+树索引算法已经不再适用于MMDB。为适应内存数据库的性能,T树,CSS树,CSB+树等索引算法相继被提出,但是这些算法没有考虑到TLB失效会影响索引的性能。本文通过对CSB+树进行改进,得到一种更适用于内存数据库的索引算法。实验证明,该索引结构可以降低TLB失配,提升处理器缓存的利用率,提高查询效率。更多还原

【Abstract】 MMDB stores data in memory for operation, which improves performance compared with disk-based database. But due to the difference in performance bottleneck between MMDB and DRDB, the B+ tree indexing algorithm for DRDB is no longer suitable for MMDB. In order to adapt to the performance of main memory database,indexing algorithms such as T-tree, CSS tree, and CSB+tree have been proposed, but these algorithms do not take into account that TLB failure will affect the performance of the index.This paper improves the CSB+ tree and obtains an indexing algorithm that is more suitable for in-memory databases.Experiments show that the index structure can reduce the TLB mismatch, improve the processor cache utilization, and improve query efficiency.更多还原