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

Abstract

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.