Optimal B-tree packing
作者:
Highlights:
•
摘要
This note presents an algorithm for optimally packing a B-tree. The advantages of optimal packing are greater storage utilization and faster retrieval performance. The algorithm inserts data faster than the standard B-tree insertion algorithm and provides simplicity of implementation.
论文关键词:B-tree,optimal packing
论文评审过程:Received 15 May 1990, Revised 23 October 1990, Available online 17 June 2003.
论文官网地址:https://doi.org/10.1016/0306-4379(91)90017-4