- Suppose We Use External Hashing To Store Records And Handle Collisions By Using Chaining Each Main Or Overflow Bucket 1 (111.04 KiB) Viewed 23 times
Suppose we use external hashing to store records and handle collisions by using chaining. Each (main or overflow) bucket corresponds to exactly one disk block and can store up to 2 records including the record pointers. Each record is of the form (SSN: int, Name: string). To hash the records to buckets, we use the hash function h, which is defined as h(k)= k mod 5, i.e., we hash the records to five main buckets numbered 0,...,4. Initially, all buckets are empty. Consider the following sequence of records that are being hashed to the buckets (in this order): (6,'A'), (5,'B'), (16,'C'), (15,'D'), (1,'E'), (10,F'), (21,'G'). State the content of the five main buckets and any overflow buckets that you may use. For each record pointer, state the record to which it points to. You can omit empty buckets.