Consider the data entries in the Linear Hashing index for Exercise 10.9.
1. Show an Extendible Hashing index with the same data entries.
2. Answer the questions in Exercise 10.9 with respect to this index
Exercise 10.9
Consider the snapshot of the Linear Hashing index shown in Figure 10.16. Assume that a bucket split occurs whenever an overflow page is created.
1. What is the maximum number of data entries that can be inserted (given the best possible distribution of keys) before you have to split a bucket? Explain very briefly.
2. Show the file after inserting a single record whose insertion causes a bucket split.
3. (a) What is the minimum number of record insertions that will cause a split of all four buckets? Explain very briefly.
(b) What is the value of Next after making these insertions?
(c) What can you say about the number of pages in the fourth bucket shown after this series of record insertions?
Figure 10.16
