B-Trees, B+Trees and Simple Prefix B+ Trees in Perspective II
Differences between the various structures:
B-Trees: multi-level indexes to data files that are entry-sequenced. Strengths: simplicity of implementation. Weaknesses: excessive seeking necessary for sequential access.
B-Trees with Associated Information: These are B-Trees that contain record contents at every level of the B-Tree. Strengths: can save up space. Weaknesses: Works only when the record information is located within the B-Tree. Otherwise, too much seeking is involved in retrieving the record information.