Loading a Simple Prefix B+ Tree I
Successive Insertions is not a good method because splitting and redistribution are relatively expensive and would be best to use only for tree maintenance.
Starting from a sorted file, however, we can place the records into sequence set blocks one by one, starting a new block when the one we are working with fills up. As we make the transition between two sequence set blocks, we can determine the shortest separator for the blocks. We can collect these separators into an index set block that we build and hold in memory until it is full.