Hash trie

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{{cite thesis |last=Liang |first=Frank Mark |title=Word hy-phen-a-tion by com-pu-ter |date=June 1983 |access-date=March 28, 2010 |type=PhD dissertation |publisher=Stanford University |url=http://www.tug.org/docs/liang/liang-thesis.pdf |page=32}}
• A data structure which "combines features of hash tables and LC-tries (least compression tries) in order to perform efficient lookups and updates"{{cite book |last1=Thomas |first1=Roshan |last2=Mark |first2=Brian |last3=Johnson |first3=Tommy |last4=Croall |first4=James |contribution=High-speed Legitimacy-based DDoS Packet Filtering with Network Processors: A Case Study and Implementation on the Intel IXP1200 |date=2003 |editor1-last=Crowley |editor1-first=Patrick |editor2-last=Franklin |editor2-first=Mark A. |editor3-last=Hadimioglu |editor3-first=Haldun |editor4-last=Onufryk |editor4-first=Peter Z. |title=Network Processor Design: Issues and Practices |volume=2 |series=Series in Computer Architecture and Design |publisher=Morgan Kaufmann Publishers |location=San Francisco |at=Chapter 12, pp. 243–272 |isbn=9780121981570 |contribution-url= http://napl.gmu.edu/pubs/BookContrib/ThomasMarkJC-NPW04.pdf |access-date=May 3, 2009}}