Tabla hash
Almacén clave-valor con búsqueda O(1) mediante función hash.
A hash table (or hash map) is a structure that can map keys to values. A hash table uses a hash [function](/es/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["Tabla hash"]:::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;
🧠 Prueba de conocimiento
🧒 Explícalo como si tuviera 5 años
Imagina un guardarropa. Das tu abrigo y recibes un número. Para recuperarlo, das el número y van directo a ese lugar. ¡Las tablas [hash](/es/terms/hash) calculan el 'número' desde tu clave!
🤓 Expert Deep Dive
Perfect hashing para sets estáticos. Cuckoo hashing para O(1) worst-case lookup. Robin Hood hashing. Consistent hashing para caches distribuidos. Bloom filters para tests probabilísticos.