B-tree indexes for high update rates

Author Goetz Graefe

Thumbnail PDF


  • Filesize: 51 kB
  • 7 pages

Document Identifiers

Author Details

Goetz Graefe

Cite AsGet BibTex

Goetz Graefe. B-tree indexes for high update rates. In Data Always and Everywhere - Management of Mobile, Ubiquitous, Pervasive, and Sensor Data. Dagstuhl Seminar Proceedings, Volume 5421, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


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 tradi-tional 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.
  • B-tree
  • high update rates


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads