About: Hash tree (persistent data structure)

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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. Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations.

Property	Value
dbo:abstract	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. Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations. (en)
dbo:wikiPageID	39393649 (xsd:integer)
dbo:wikiPageLength	1018 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	732879549 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Persistent_data_structure dbr:Ctrie dbc:Functional_data_structures dbr:Trie dbr:Hash_array_mapped_trie dbr:Hash_function dbr:Purely_functional_programming dbc:Hashing dbr:Hash_table dbr:Associative_array dbr:Set_(abstract_data_type)
dbp:wikiPageUsesTemplate	dbt:CS-Trees dbt:Reflist dbt:Compu-prog-stub dbt:Data_structures
dcterms:subject	dbc:Functional_data_structures dbc:Hashing
gold:hypernym	dbr:Structure
rdf:type	yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:WikicatFunctionalDataStructures dbo:Building yago:Structure105726345
rdfs:comment	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. Hash array mapped tries and Ctries are refined versions of this data structure, using particular type of trie implementations. (en)
rdfs:label	Hash tree (persistent data structure) (en)
owl:sameAs	freebase:Hash tree (persistent data structure) yago-res:Hash tree (persistent data structure) wikidata:Hash tree (persistent data structure) https://global.dbpedia.org/id/fPuE
prov:wasDerivedFrom	wikipedia-en:Hash_tree_(persistent_data_structure)?oldid=732879549&ns=0
foaf:isPrimaryTopicOf	wikipedia-en:Hash_tree_(persistent_data_structure)
is dbo:wikiPageDisambiguates of	dbr:Hash_tree
is dbo:wikiPageWikiLink of	dbr:List_of_algorithms dbr:Apriori_algorithm dbr:GSP_algorithm dbr:Hash_array_mapped_trie dbr:Hash_trie dbr:Hash_tree dbr:Association_rule_learning dbr:Venti
is foaf:primaryTopic of	wikipedia-en:Hash_tree_(persistent_data_structure)