
OrderedCollection
Chapter 36
B-Tree Data Structure
AbstractCollection<E> implements Collection<E>
↑
AbstractSearchTree<E> implements OrderedCollection<E>
↑
BTree<E> implements OrderedCollection<E>
Uses: Java references and sorted array (Chapter 30)
Used By: TaggedBTree (Section 49.9.6)
Strengths: B-trees are designed for collections that are so large that the structure itself (not in-
cluding the elements) cannot fit in main memory. When the data structure must reside in secondary
storage, the dominant cost is the number of disk pages that must be accessed to locate the desired
element. The B-tree is a generalization of a binary search tree designed to