An adaptive overflow technique for B-trees
- First Online:
- Cite this paper as:
- Baeza-Yates R.A. (1990) An adaptive overflow technique for B-trees. In: Bancilhon F., Thanos C., Tsichritzis D. (eds) Advances in Database Technology — EDBT '90. EDBT 1990. Lecture Notes in Computer Science, vol 416. Springer, Berlin, Heidelberg
We present a new overflow technique for the B-tree. The technique is a hybrid of partial expansions and unbalanced splits. This technique is asymmetric and adaptive. Considering a growing file (only insertions), the storage utilization is 77% for random keys, 70% for sorted keys, and over 75% for non-uniform distributed keys. Similar results are achieved when we have deletions mixed with insertions. One of the main properties of this technique is that the storage utilization is very stable with respect to changes of the data distribution. This technique may be used for other bucket-based file structures, like extendible hashing or bounded disorder files.
Unable to display preview. Download preview PDF.