Exercise 3. (25%) a) (15%) An example of the linear hash index is given below. Every time a new overflow page is added, the bucket pointed by Next is split, and Next is incremented by one. Show the index state after adding the keys 39, 25, and 29. h1 ho Level=0, N=4 000 00 0*8* 001 01 17*33* 010 10 6*26* 42* 011 11 7* 11* 15* 23* 100 00 4* 12* 20* 101 01 5* 13* 21* 37* Next b) (5%) Assume that the above data was entered into an extendable hashing index. What would be the size of the directory? c) (5%) Describe the bulk loading algorithm for B+ trees. What are the differences to using a simple B+ tree add operation?

Programming Logic & Design Comprehensive

Question

Check Mark

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

See solution