A dynamic hashing table that grows a few slots at a time. It uses a hash function, h, with a range of (0,1). For a key, k, an intermediate value, x=⌈ S-h(k)⌉ +h(k), is computed to find the final slot, ⌊ d^x⌋, where d>1 is called the growth factor. To increase the number of slots, increase S to S' and rehash any keys from ⌊ d^S⌋ to ⌊ d^S'⌋-1.