B-tree indexes for high update rates

Data Always and Everywhere - Management of Mobile, Ubiquitous, Pervasive, and Sensor Data

计算机科学;物理学

Goetz Graefe

Others  :  http://drops.dagstuhl.de/opus/volltexte/2006/763/pdf/05421.GraefeGoetz.Paper.763.pdf
PID  :  6715

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering using automated sensors often exhibits this imbalance. More generally, indexing streams apparently is considered an unsolved problem. For those applications, B-tree indexes are reasonable choices if some trade-off decisions are tilted towards optimization of updates rather than of queries. This paper surveys techniques that let B-trees sustain very high update rates, up to multiple orders of magnitude higher than traditional B-trees, at the expense of query processing performance. Perhaps not surprisingly, some of these techniques are reminiscent of those employed during index creation, index rebuild, etc., while others are derived from other well known technologies such as differential files and log-structured file systems.