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 hash table.) [1][verification needed]
A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" [2]
^Liang, Frank Mark (June 1983), Word hy-phen-a-tion by com-pu-ter(Ph.D. thesis), Stanford University, retrieved 2010-03-28
^Thomas, Roshan; Mark, Brian; Johnson, Tommy; Croall, James (2004), High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200(PDF), retrieved 2009-05-03