B-Trees, B+Trees and Simple Prefix B+ Trees in Perspective III
Differences between the various structures (Cont’d):
B+ Trees: In a B+ Tree all the key and record info is contained in a linked set of blocks known as the sequence set. Indexed access is provided through the Index Set. Advantages over B-Trees: 1) The sequence set can be processed in a truly linear, sequential way; 2) The index is built with a single key or separator per block of data records rather than with one key per data record. ==> index is smaller and hence shallower.
Simple Prefix B+ Trees: The separators in the index set are smaller than the keys in the sequence set ==> Tree is even smaller.