| Discuss B-Trees |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Tables
stored externally can be searched |
|||||||||||
| with
B-Trees. |
||||||||||||
| – | B-Trees
are a more generalized approach than |
|||||||||||
| the
2-3 Tree |
||||||||||||
| – | With
externally stored tables, we want to keep |
|||||||||||
| the
search tree as short as possible; it is much |
||||||||||||
| faster
to do extra comparisons at a particular |
||||||||||||
| node
than try to find the next node. |
||||||||||||