hash table
Index-mapped container
A hash table is a data structure that stores key-value pairs for rapid lookup.
It uses a hash function to convert keys into array indices, allowing retrieval in nearly constant time regardless of the table's size.
Hash tables power dictionaries in programming languages and databases: The program stores user sessions in a hash table for quick access.
Also called a hash map.
Alphabetical word reference
Data pair structure
- bucketOpen-top carrying vessel
- arrayOrdered collection or display
- slotNarrow slit for insertion
- entryAccess or submission
node · index · pointer · linked list · pair · chaining · tombstone · capacity
Act of retrieving information
get · put · find · access · resize · probe · traverse · update
Forceful contact between objects
- moduloRemainder after division
- distributionAllocation across recipients
- foldingBending something over itself
- digestMetabolize or summarize
Gradual debt reduction schedule
- throughputProcessing rate over time
- worst caseMost unfavorable possibility
- clusteringForming concentrated groups
- scalabilityCapacity for growth
dictionary
Alphabetical word reference
key-value
Data pair structure
entry · node · index · pointer · linked list · pair · chaining · tombstone · capacity · size
lookup
Act of retrieving information
retrieve · get · put · find · access · resize · probe · traverse · update · contains
collision
Forceful contact between objects
- moduloRemainder after division
- distributionAllocation across recipients
- foldingBending something over itself
amortization
Gradual debt reduction schedule
- throughputProcessing rate over time
- worst caseMost unfavorable possibility
- clusteringForming concentrated groups