The reason this often isn't a problem in practice is that hash tables are typically used in cases where you're going to be accessing elements randomly anyways.

The reason this often isn't a problem in practice is that hash tables are typically used in cases where you're going to be accessing elements randomly anyways. If you're accessing elements randomly, I don't know of a data structure that will do a better job of keeping things in cache.