Hash Tables Lead To Fast Searches

Hash tables are formed from dictionaries by replacing keys with their hashes.  Consider storing the dictionary values at memory addresses equal to the corresponding hashes.  Then, searching for dictionary values would mainly involve just finding hashes!