Due: Monday, Nov. 11
Exercises from the Textbook
From the textbook chapter 14 (Index Structures): Do exercises 1.1, 1.2, 2.1, 2.3, and 2.5 parts f--i.
Additional Exercises
Suppose that we are building a B-tree index where blocks can hold 10 keys and 11 pointers. Assuming that nodes are completely full, what is the maximum number of unique keys that could be stored in a tree with three levels? How about 4 levels? How about 5?
Now assume that all blocks (including branches) are only 70% full. How many tuples would be indexed by trees of 3 to 5 levels?