hashtable

Indexed lookup structure

A hashtable is a data structure that stores key-value pairs for rapid lookup.

Instead of searching through items sequentially, it uses a hash function to compute an index where each value is stored, allowing near-instant retrieval: The hashtable maps usernames to account objects.

Also called a hash map or dictionary in various programming languages.

implementation

bucket

Open-top carrying vessel

slot · entry · key-value · dictionary · map · lookup · insertion · deletion · resize · capacity

hashing

collision

Forceful contact between objects

prime · key · mapping · uniformity · deterministic · bitwise · seed · distribution

operations

get

Obtain or become

lookup · search · insert · remove · update · iterate · keys · values · entries · clear

storage

memory

Mind's retention capacity

  • pointerReference to memory location
  • nodeConnection point in networks
  • entryAccess or submission

pair · allocation · capacity · heap · overflow · resize · shrink · in-memory · persistent

performance

amortization

Gradual debt reduction schedule

scalability · benchmark

Opposites
data structure ordering

hashtableordered list

Numbered series of items

B-tree · treemap · linked list · heap · tree structure

access pattern

hashtablelinked list

Sequential nodes with pointers

array · list · queue · stack · stream

Family

hash, table, hashes, hashed, hashing, tables, tabled, tabling, tabular

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G