Hash tables are a type of data structure in which the address index value of the data element is generated from a hash function. This way, data is stored in an array format, where each data value has its own unique index value. This enables very fast data access as the index value behaves as a key for the data value.