We consider dictionaries of size n over the finite universe u = (0, l}w and introduce a new technique for their implementation: error correcting codes. The use of such codes makes it possible to replace the use of strong forms of hashing, such as universal hashing, with much weaker forms, such as clustering. We use our approach to construct, for any E > 0, a deterministic solution to the dynamic dictionary problem using linear space, with worst case time 0 n') for insertions and deletions, and worst case time O(1) I or lookups. This is the first deterministic solution to the dynamic dictionary problem with linear space, constant query time, and nontrivial update time. In particular, we get a solution to the static dictionary problem with O(n) space, worst case query time
Miltersen REF has constructed a deterministic dynamic dictionary using error correcting codes and clustering.
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
SODA '98
Mathematics Computer Science