The DCB-Tree: A Space-Efficient Delta Coded Cache Conscious B-Tree

被引：0

作者：

Binna, Robert ^{[1
]}

Pacher, Dominic ^{[1
]}

Meindl, Thomas ^{[1
]}

Specht, Guenther ^{[1
]}

机构：

[1] Univ Innsbruck, Inst Comp Sci, Databases & Informat Syst, A-6020 Innsbruck, Austria

来源：

IN MEMORY DATA MANAGEMENT AND ANALYSIS | 2015年 / 8921卷

关键词：

Indexing; Main-memory; Delta-encoding; Cache-optimized; MAIN-MEMORY;

D O I：

10.1007/978-3-319-13960-9_10

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Main-memory index structures have become mainstream for a large number of problem domains. However, in the case of web-based datasets, which feature exponential growth, it is an ongoing challenge to fit those data entirely in main-memory. In this paper, we present the DCB-Tree, an extremely space efficient main-memory index structure for the storage of short fixed-size keys. It features a two-stage cache-line aligned node layout. In comparison to other main-memory index structures it reduces the amount of memory required by 80% in the best and by 30% in the worst case. Although it is tailored towards space consumption, it features good overall performance characteristics. In particular, in the case of very large real world datasets it provides performance equal or superior to state of the art main-memory index structures.

引用

页码：126 / 138

页数：13