Hash tree (persistent data structure): Difference between revisions

Revision as of 02:30, 21 June 2013

Latest revision as of 22:49, 23 December 2024

(6 intermediate revisions by 5 users not shown)

Line 1:

{{Short description|Formatted data in computer science}}

{{mergefrom|Hash array mapped trie|date=May 2013}}

{{mergefrom|Ctrieone source |date=MayApril 20132024}}

In computer science, a '''hash tree''' (or '''hash [[trie]]''') is a [[persistent data structure]] that can be used to implement [[Set (abstract data type)|sets]] and [[Associative array|maps]], intended to replace [[hash table]]s in [[purely functional]] programming]]. In its basic form, a hash tree stores the [[Hash function|hashes]] of its keys, regarded as strings of bits, in a trie, with the actual keys and (optional) values stored at the trie's "final" nodes.<ref name="bagwell">{{cite report

|title=Ideal Hash Trees

|author=Phil Bagwell

Line 9:

}}</ref>

[[Hash array mapped trie]]s and [[Ctrie|Ctries]]s are refined versions of this data structure, using particular type of trie implementations.<ref name="bagwell"/>

==References==

Line 19:

[[Category:Functional data structures]]

[[Category:Hashing]]

{{compu-prog-stub}}