用于数据存储的线性哈希

Question

Assume I am using linear hashing , assume 3 number per block and no overflow buffer. I want to insert 100 zero. It seems that no matter how many splits I do, the number cannot be inserted. How linear hashing handle that? I know the data is extremely shew in that case but I just want to know how linear hashing handle it. Or that is the limitation of linear hashing.

Answer 1

That is correct - the data cannot be accommodated. If there are no overflow blocks, and more hash collisions than can fit in the initial block, the data cannot be stored. Presumably the implementation would signal failure in some way.