1,075 views

1 Answer

0 votes
0 votes
Open hashing may place keys with the same hash function value in different buckets. Closed hashing always places such keys together in the same bucket. Thus in this case, different buckets can be of different sizes, though the implementation may be by linking together fixed size buckets using overflow chains. Deletion is difficult with open hashing as all the buckets may have to inspected before we can ascertain that a key value has been deleted, whereas in closed hashing only that bucket whose address is obtained by hashing the key value need be inspected. Deletions are more common in databases and hence closed hashing is more appropriate for them. For a small, static set of data lookups may be more efficient using open hashing. The symbol table of a compiler would be a good example

Related questions

0 votes
0 votes
1 answer
1
akash.dinkar12 asked Apr 1, 2019
1,644 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
2
akash.dinkar12 asked Apr 1, 2019
638 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
0 answers
3
akash.dinkar12 asked Apr 1, 2019
283 views
How does data encryption affect index schemes ? In particular, how might it affect schemes that attempt to store data in sorted order ?