Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

BTW 2003, Datenbanksysteme für Business, Technologie und Web, Tagungsband der 10. BTWKonferenz, 26.-28. Februar 2003, Leipzig. P-26, 668-671 (2003).

GI, Gesellschaft für Informatik, Bonn


Gerhard Weikum (ed.), Harald Schöning (ed.), Erhard Rahm (ed.)

Copyright © GI, Gesellschaft für Informatik, Bonn


Partitioned B-trees - a user's guide

Goetz Graefe


A recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually is only a single value in this column, there usually is only a single partition, and queries and updates perform just like in traditional B-tree indexes. By temporarily permitting multiple values, at the expense of reduced query performance, interesting database usage scenarios become possible, in particular for bulk insert (database load). The present paper guides database administrators to exploiting partitioned B-trees even if they are not implemented by their DBMS vendor.

Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-88579-355-5

Last changed 04.10.2013 17:56:46