A hash table is an associative data structure implementing key-value mapping with average-case constant time O(1) retrieval. A mathematical hash function maps arbitrary keys to bounded integer indices within an array of storage buckets. When multiple distinct keys hash to identical bucket indices (collisions), collision resolution strategies such as separate chaining (linked list buckets) or open addressing preserve unambiguous element access.