Problem 3. (25 points) (Extendible Hashing) Suppose that we have an extendible hashing index with the following state: 1

[answerhappygod]

Problem 3 25 Points Extendible Hashing Suppose That We Have An Extendible Hashing Index With The Following State 1 1 (143.08 KiB) Viewed 12 times

Problem 3. (25 points) (Extendible Hashing) Suppose that we have an extendible hashing index with the following state: 1 1 10 12 0 1 27 13 35 Assume that every index bucket (block) can store up to 4 values. Consider now the following values: (449, 124, 654, 1016, 285, 468, 615, 340, 331, 135, 667) Insert these values into the index above (that already contains 10 and 27) using the insertion algorithm of extendible hashing. Show the state of the index after every 8 insertions, and the global and local depths. Use the hash function: h(K) = K mod 128 and then apply the extendible hashing technique. Notice that, using this function, every number is mapped first to a number between 0 and 127 and then we take its binary representation. Then, the extendible hashing technique is applied on the binary representation. 1