Hash tree (persistent data structure): Difference between revisions

Revision as of 11:03, 15 May 2013

Revision as of 11:17, 15 May 2013

Line 1:

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 name="bagwell">{{cite report

|title=Ideal Hash Trees

|author=Phil Bagwell

Line 6:

|year=2000

}}</ref>

[[Hash array mapped trie]]s are a refined version of this data structure, using a particular type of trie implementation.<ref name="bagwell"/>

==References==