The definition of a B-tree stipulates that the nodes have to behalf full, and the definition of a B*-tree increases thisrequirement to two-thirds. The reason for these requirements is toachieve reasonably good disk space utilization. However, it may beclaimed that B-trees can perform very well requiring only that theyinclude no empty nodes. To distinguish between these two cases, theB-trees discussed in this chapter are called merge-at-halfB-trees, and the other type, when nodes must have at least oneelement, are called free-at-empty B-trees. It turns out,for example, that after free-at-empty B-tree is built and then eachinsertion is followed by deletion, the space
PayPal Gateway not configured
PayPal Gateway not configured