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[clarification needed]hash table
A data structure which "combines features of hash tables and LC-tries (least compression tries) in order to perform efficient lookups and updates"
This set index article includes a list of related items that share the same name (or similar names). If an internal link incorrectly led you here, you may wish to change the link to point directly to the intended article.