A dynamic hashing table that grows one slot at a time. It has a family of hash functions, h_i, where the range of h_i+1 is twice the range of h_i. Slots below a pointer, p, have been split. That is, key, k, is in slot h_i(k) if h_i(k) > p. Otherwise it is in h_i+1(k). To maintain the load factor, slot p can be split (rehashed with h_i+1) and p incremented. When p reaches the end, the ranges are doubled (i is incremented), and p starts over.