next up previous
Next: B-Trees Up: CSE 2320: Algorithms and Previous: CSE 2320: Algorithms and


B-Trees are useful in the following cases:

The number of objects is too large to fit in memory.
Need external storage.
Disk accesses are slow, thus need to minimize the number of disk accesses.

Red-Black trees are not good in these situations, only retrieves one key at a time from memory.

Copyright © 1998 The University of Texas at Arlington