Linear hashing: Difference between revisions

Content deleted Content added
Line 35:
and overflow buckets are eventually reabsorbed during a later split, which must eventually happen because splitting occurs round robin.
 
One problem is that after a bucket is split, it'sits old hash function has been replaced by the newer hash function ( hash(key) mod N * (2<sup> level'''+1''' </sup> ).
To determine whether the old mod 2<sup> level</sup> should be used, the old hash is applied first, and then if it is < split variable , then
it is recalculated with mod N * 2<sup> level +1 </sup> . Note this depends on the property that for any y = x mod M , y' = y or y + M if calculated as y' = x mod M * 2 .
Therefore the new hash function will only hash to buckets created by previous splits.