Content deleted Content added
don't forget to store the keys |
Adding local short description: "Formatted data in computer science", overriding Wikidata description "persistent data structure for hashes" |
||
| (14 intermediate revisions by 6 users not shown) | |||
Line 1:
{{Short description|Formatted data in computer science}}
In computer science, a '''hash tree''' 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>{{cite report▼
{{one source |date=April 2024}}
▲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
|title=Ideal Hash Trees
|author=Phil Bagwell
Line 6 ⟶ 8:
|year=2000
}}</ref>
[[Hash array mapped trie]]s and [[Ctrie]]s are refined versions of this data structure, using particular type of trie implementations.<ref name="bagwell"/>
==References==
Line 14 ⟶ 18:
[[Category:Functional data structures]]
[[Category:Hashing]]
{{compu-prog-stub}}
| |||