About: Hash trie

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

In computer science, hash trie can refer to: * Hash tree (persistent data structure), a trie used to map hash values to keys * A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) * A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates"

Property Value
dbo:abstract
  • In computer science, hash trie can refer to: * Hash tree (persistent data structure), a trie used to map hash values to keys * A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) * A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" (en)
dbo:wikiPageID
  • 3568843 (xsd:integer)
dbo:wikiPageLength
  • 1464 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 981889179 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In computer science, hash trie can refer to: * Hash tree (persistent data structure), a trie used to map hash values to keys * A space-efficient implementation of a sparse trie, in which the descendants of each node may be interleaved in memory. (The name is suggested by a similarity to a closed hash table.) * A data structure which "combines features of hash tables and LC-tries (Least Compression tries) in order to perform efficient lookups and updates" (en)
rdfs:label
  • Hash trie (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License