[prev] 42 [next]

Selection with Lin.Hashing (cont)

Modified search algorithm:

// select * from R where k = val
h = hash(val);
P = bits(d,h);
if (P < sp) { P = bits(d+1,h); }
for each tuple t in page P
         and its overflow blocks {
    if (t.k == val) return R;
}