Achieving minimum height for block split tree structured files

摘要

In this paper we describe a technique to maintain minimum height for block split tree structured files such as the B-tree and its variants. The technique is not complex and involves negligible overhead. We also model the root node insertion activity for block split tree structured files. Our model enables us to predict the effectiveness of our new technique. We present experimental data to verify our model's predictions.