... as possible, yet they must, between them, cover all the data regions of the original leaf. Having split the leaf, we replace the region and pointer for the original leaf at the node above by ... the record. If there is no reason to organize the file any other way, we can even use the record number as the search key for a primary index, as discussed in Sec- tion 13.1. Then, the ... consider n-hether the distance between P and a border of its bucket is less than the distance from P to Q. If there arc such horders, then the adjacent buckets on the other side of...