Hash trie explained

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]
• 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

• Hash array mapped trie
• Hashed array tree
• Merkle tree

Notes and References

1. Liang . Frank Mark . Word hy-phen-a-tion by com-pu-ter . PhD dissertation . June 1983 . . March 28, 2010.
2. Book: Thomas . Roshan . Mark . Brian . Johnson . Tommy . Croall . James . High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200 . 2003 . Crowley . Patrick . Franklin . Mark A. . Hadimioglu . Haldun . Onufryk . Peter Z. . Network Processor Design: Issues and Practices . 2 . Series in Computer Architecture and Design . Morgan Kaufmann Publishers . San Francisco . Chapter 12, pp. 243–272 . 9780121981570 . http://napl.gmu.edu/pubs/BookContrib/ThomasMarkJC-NPW04.pdf . May 3, 2009.