1,667 views

1 Answer

1 votes
1 votes
A range query cannot be answered efficiently using a hash index, as all the hash buckets would have to be read because key values in the range do not occupy consecutive locations in the buckets.

for better use of hash table keys should be distributed uniformly through all the bucket

Related questions

0 votes
0 votes
1 answer
1
akash.dinkar12 asked Apr 1, 2019
656 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
2
akash.dinkar12 asked Apr 1, 2019
1,100 views
Explain the distinction between closed and open hashing. Discuss the relative merits of each technique in database applications.
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Apr 1, 2019
296 views
How does data encryption affect index schemes ? In particular, how might it affect schemes that attempt to store data in sorted order ?