DCST:主存空间高效的缓存敏感型T-树索引研究  

DCST: Main Memory Space-Efficient Delta Coded Cache Conscious T-tree

作　　者：史太齐 刘亮[1] 秦小麟[1] SHI Taiqi;LIU Liang;QIN Xiaolin(College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016,China)

机构地区：[1]南京航空航天大学计算机科学与技术学院,南京210016

出　　处：《计算机科学与探索》2017年第2期221-230,共10页Journal of Frontiers of Computer Science and Technology

基　　金：国家自然科学基金Nos.61373015;61300052;41301047;江苏高校优势学科建设工程资助项目~~

摘　　要：已有主存索引通过指针消除和预取机制提升索引结构的缓存感知能力,减少缓存失效次数,但是并没有有效地利用现代计算机的CPU性能和内存空间。为了进一步提升索引结构对内存空间以及CPU性能的利用率,提出了DCST-树索引结构。该索引结构采用数据压缩的方式,对结点中的关键字进行压缩,提高索引结构对内存空间和缓存空间的利用率,减少内存访问次数,提高缓存命中率。同时,对结点进行分区,增加结点容量,提高结点扇出度,降低树的高度。实验结果表明,所提方案比现有主存索引机制具有更加高效的空间利用率和缓存感知能力,同时具有更加优秀的查询处理能力。Existing main-memory index structures use pointer elimination and prefetching mechanism to improvethe cache consciousness of index structure and reduce the number of cache invalidation,but do not make efficientuse of main-memory space and CPU performance.To make index structure utilize memory and CPU much better,this paper proposes DCST-tree.DCST-tree implements data compression to use memory and cache space more effectively.This can reduce the number of swap between memory and cache,and improve the rate of cache hit eventually.Meanwhile,node is partitioned into buckets to increase node size and improve the fan-out degree of node,such thatthe height of index tree can be reduced.The experimental results show that the proposed index structure has highercache consciousness and space utilization,compared with existing index structures.

关 键 词：压缩 主存索引 缓存敏感 

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