Dynamic Hashing
Practice Exercise
Suppose that extendable hashing is being used on a database file that
contains records with the following search key values: 2, 3, 5, 7, 11, 17,
19, 23, 29, 31
a) Construct the extendable hash structure for this file if the hash function
is h(x) = x mod 7 and each bucket can hold three records.
b) Show how the structure from part a) changes after inserting a record
with the search key value of 16 and then deleting the record with the
search key value of 11.)