Rudi Maelbrancke

Optimizing Jan Jannink's Implementation of B + -tree deletion

In this note we propose optimization strategies for the B+-tree deletion algorithm. The optimizations are focused on even order B+-trees and on the reduction of the number of block accesses.

DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING

A simple algorithm is given to rebalance a binary search tree of optimal height after a single update. The algorithm uses time which is linear in the number of nodes. In comparison to previous algorithms it is short and very easy to implement. Moreover, this algorithm can be used to implement other classes of balanced trees and it is suitable for each update. When applied to perfectly balanced trees it has a lower average cost than previous algorithms.