Hashtabelle
Schlüssel-Wert-Speicher mit O(1)-Suche durch Hash-Funktion.
A hash table (or hash map) is a structure that can map keys to values. A hash table uses a hash [function](/de/terms/hash-function) to compute an index into an array of buckets or slots, from which the desired value can be found. In an ideal case, the hash function will assign each key to a unique bucket, but most hash table designs employ some form of collision resolution.
graph LR
Center["Hashtabelle"]:::main
Rel_index_database["index-database"]:::related -.-> Center
click Rel_index_database "/terms/index-database"
Rel_relational_database["relational-database"]:::related -.-> Center
click Rel_relational_database "/terms/relational-database"
Rel_object["object"]:::related -.-> Center
click Rel_object "/terms/object"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧠 Wissenstest
🧒 Erkläre es wie einem 5-Jährigen
Stell dir eine Garderobe vor. Du gibst deinen Mantel ab und bekommst eine Nummer. Mit der Nummer findet man den Mantel sofort wieder. Hashtabellen berechnen die 'Nummer' aus deinem Schlüssel!
🤓 Expert Deep Dive
Perfektes Hashing garantiert O(1). Cuckoo Hashing. Robin Hood Hashing. Consistent Hashing für verteilte Caches. Bloom Filter.