B-Trees and Comparisons

• B-Trees are file based.

• “Descending” the tree requires you to read another block from a random location in the index file.

• reading blocks is far, far more time consuming than processing the information contained in the block.

• We could perform thousands of comparisons in the time required to fetch a single block.