Optimal B-tree packing

摘要

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.