Question

Hashing is an effective technique to calculate the direct address of a record without using index structure. However in static hashing the function maps search-key values only to a fixed set of bucket addresses and also performance degrades due to bucket overflow as databases grow with time and if they shrink, space gets wasted. Explain how these problems can be avoided by techniques that allow buckets to be modified at runtime.

Answer 1

Answer:

the answer to this question is yes

Answer 2

Answer:

reel classical L

Explanation:

Chhattisgarh Battista aansoo