计算机科学与探索2017，Vol.11Issue(2)：221-230,10.DOI:10.3778/j.issn.1673-9418.1603029
DCST:主存空间高效的缓存敏感型T-树索引研究
DCST: Main Memory Space-Efficient Delta Coded Cache Conscious T-tree
摘要
Abstract
Existing main-memory index structures use pointer elimination and prefetching mechanism to improve the cache consciousness of index structure and reduce the number of cache invalidation,but do not make efficient use 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 that the height of index tree can be reduced.The experimental results show that the proposed index structure has higher cache consciousness and space utilization,compared with existing index structures.关键词
压缩/主存索引/缓存敏感Key words
compression/main-memory index/cache consciousness分类
信息技术与安全科学引用本文复制引用
史太齐,刘亮,秦小麟..DCST:主存空间高效的缓存敏感型T-树索引研究[J].计算机科学与探索,2017,11(2):221-230,10.基金项目
The National Natural Science Foundation of China under Grant Nos.61373015,61300052,41301047(国家自然科学基金) （国家自然科学基金）
the Priority Academic Development Program of Jiangsu Higher Education Institutions(江苏高校优势学科建设工程资助项目). （江苏高校优势学科建设工程资助项目）
