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

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