means a data structure that stores key-value pairs and finds them in roughly constant time by turning the key into an index via a hash function.

from emerged from 1950s IBM research into hashing for fast data retrieval; hans peter luhn's internal memos sketched the core idea before it became a computer science staple.