Discuss B-Trees
•Every
time we want to get another node,
–we
have to access the external file and read in the appropriate
information.
–It
takes far less time to operate on a particular node (i.e., doing comparisons)
once it has been read in.
–This
means that for externally stored tables we should try to reduce the height of the
tree...even if it means doing more comparisons at every node.