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
January 01, 1970
hash, trie, computer, science, hash, trie, refer, hash, tree, persistent, data, structure, trie, used, hash, values, keys, space, efficient, implementation, sparse, trie, which, descendants, each, node, interleaved, memory, name, suggested, similarity, closed,. In computer science hash trie can refer to Hash tree persistent data structure a trie used to map hash values to keys 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 See also editHash array mapped trie Hashed array tree Merkle treeReferences edit 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 Retrieved from https en wikipedia org w index php title Hash trie amp oldid 981889179, wikipedia, wiki, book, books, library,
