2,385 views
1 votes
1 votes
Suppose that we are using extendable hashing on a file that contains records with the following search-key values:
$2, 3, 5, 7, 11, 17, 19, 23, 29, 31$
Show the extendable hash structure for this file if the hash function is $h(x)$ $=$ $x$ $mod$ $8$ and buckets can hold three records.

1 Answer

Related questions

0 votes
0 votes
1 answer
2
akash.dinkar12 asked Apr 1, 2019
1,645 views
Why is a hash structure not the best choice for a search key on which range queries are likely ?
0 votes
0 votes
1 answer
3
akash.dinkar12 asked Apr 1, 2019
640 views
What are the causes of bucket overflow in a hash file organization ? What can be done to reduce the occurrence of bucket overflows ?
0 votes
0 votes
1 answer
4
akash.dinkar12 asked Apr 1, 2019
1,076 views
Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.