If the number of possible keys is small and they are unique, then the table can be a BIG array.
Let the universe of m possible keys be U = {0, 1, .., m-1}.
Direct-Address Table T[0,..,m-1] is an array. Each slot (array element) corresponds to a unique key.