Achieving minimum height for block split tree structured files
作者:
Highlights:
•
摘要
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.
论文关键词:
论文评审过程:Received 3 April 1986, Available online 10 June 2003.
论文官网地址:https://doi.org/10.1016/0306-4379(87)90022-6