
OrderedCollection
Chapter 37
B+-Tree Data Structure
AbstractCollection<E> implements Collection<E>
↑
AbstractSearchTree<E> implements OrderedCollection<E>
↑
BTree<E> implements OrderedCollection<E>
↑
BPlusTree<E> implements OrderedCollection<E>
Uses: Java references and sorted array (Chapter 30)
Used By: TaggedBPlusTree (Section 49.9.7)
Strengths: Like the B-tree data structure, a B+-tree is designed for ordered collections that must
be held in secondary storage. As with a B-tree, a B+-tree of order t can hold up to 2t − 1 elements
in each node. By adjusting t, the B+-tree can be adapted so that a full node fills a disk page. The
advantage of a B+-tree over ...