Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Hash trie
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, hash trie can refer to: </p> <ul><li><a href="/facts/Hash_tree_(persistent_data_structure)/YqxhuTTM">Hash tree (persistent data structure)</a>, a <a href="/facts/Trie/cXNr0ScT">trie</a> used to map hash values to keys</li> <li>A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory; the name is suggested by a similarity to a closed <a href="/facts/Hash_table/Ht4ptDPF">hash table</a></li> <li>A data structure which "combines features of hash tables and LC-tries (least compression tries) in order to perform efficient lookups and updates"</li></ul>