Concepts
Hash Table
Also Known As Hash Map
Data Structure
Citation Formats
General Reference
APA Style
BibTeX
A hash table is a data structure that implements an associative array, also called a dictionary or map: it stores key and value pairs and finds a value from its key in roughly constant expected time by computing where the entry lives rather than searching for it. The idea of hashing with chaining appears as early as January 1953, in an internal IBM memorandum by Hans Peter Luhn, and hash tables now sit inside nearly every language runtime and database.
Facts
Origin YearThe January 1953 IBM memorandum by Hans Peter Luhn that used hashing with chaining. Core PrincipleCompute where a value belongs from its own key, so a lookup goes straight to the right place instead of searching. 1 Cross-Tradition Connections
Sources
1. Wikipedia: Hash Table
Wikimedia FoundationOverview and History sectionsQuote, Overview and History sections
a hash table is a data structure that implements an associative array, also called a dictionary or simply map
1. Wikipedia: Hash Table
Wikimedia FoundationHistory sectionQuote, History section
In January 1953, Hans Peter Luhn wrote an internal IBM memorandum that used hashing with chaining.
1. Wikipedia: Hash Table
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.