HT树:缓存敏感的内存数据库索引  

Hash & Tree Tree:Cache Conscious Index of Memory Database

作　　者：肖富平[1] 罗军[1] 

机构地区：[1]重庆大学计算机学院,重庆400030

出　　处：《计算机工程》2009年第16期68-70,共3页Computer Engineering

摘　　要：在内存数据库系统中,针对处理器缓存对提高内存数据库的性能有重要影响的情况,在B+树的基础上提出一种新的缓存敏感的索引——HT索引。将Hash方法和树结构相结合,构造一种适用于内存数据库的索引。结果证明,该索引结构能提高处理器缓存的利用率,其整体操作性能优于传统的缓存敏感索引。In memory databases, making good use of the processor caches is of great significance to enhance the performance of memory database. In order to deal with the problem above, based on B＋ tree, a cache conscious index called ＂Hash ＆ Tree Tree（HT Tree）＂ is proposed. This index, which combines Hash with tree, is constructed for memory database. Result shows that the index can improve the utilization rate of processor caches. It can gain better performance than conventional cache conscious indices.

关 键 词：索引 缓存敏感的索引 B+树 HT树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]