The usual insertion algorithm for B-trees [l] leads to the minimum storage utilization in case
the keys to be inserted are ordered. The overflow technique can be used to optimize the
page utilization but the number of overflow movings to be performed is very high and it
involves many storage accesses, in fact every overflow moving affects three pages (the two
brother pages and their father page). A construction algorithm for ordered keys is presented
in this paper. The algorithm avoids the splitting procedure substituting it by a less expensive …