Demonstrate insertion into a linear hash file. Assume that bucket splitting happens whenever the file load factor exceeds (is greater than) 0.8. The file load factor is defined as the ratio of inserted records r divided by the product of slots per bucket m (not counting overflow buckets) and number of buckets n (file load factor = r/(m*n)). Start with a hash file with n=2 buckets, and use the remainder function as hash function. Each bucket is supposed to have m=2 slots. Draw a new figure each time a bucket is split. Enter the following numbers 8, 9, 7, 5, 6, 4, 2.
Explain linear hashing using the example in a).