Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Dynamic perfect hashing
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, dynamic perfect hashing is a programming technique for resolving <a href="/facts/Hash_collision/QwAesPFG">collisions</a> in a <a href="/facts/Hash_table/Ht4ptDPF">hash table</a> <a href="/facts/Data_structure/yNsNvL1I">data structure</a>. While more memory-intensive than its hash table counterparts, this technique is useful for situations where fast queries, insertions, and deletions must be made on a large set of elements. </p>