Hash tree (persistent data structure)


Contributors to Wikimedia projects

Article Images

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Hash tree" persistent data structure – news · newspapers · books · scholar · JSTOR (April 2024)

In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables in purely functional programming. In its basic form, a hash tree stores the 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.[1]

Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.[1]

References

edit

  1. ^ a b Phil Bagwell (2000). Ideal Hash Trees (PDF) (Report). Infoscience Department, École Polytechnique Fédérale de Lausanne.
 

This computer-programming-related article is a stub. You can help Wikipedia by expanding it.