| http://dbpedia.org/ontology/abstract
|
In computer science, hash trie can refer t … 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" to perform efficient lookups and updates"
|
| http://dbpedia.org/ontology/wikiPageID
|
3568843
|
| http://dbpedia.org/ontology/wikiPageLength
|
1464
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
981889179
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Merkle_tree +
, http://dbpedia.org/resource/Hash_array_mapped_trie +
, http://dbpedia.org/resource/Hashed_array_tree +
, http://dbpedia.org/resource/Hash_tree_%28persistent_data_structure%29 +
, http://dbpedia.org/resource/Hash_table +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Trie +
, http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Verify_source +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Hash_trie?oldid=981889179&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Hash_trie +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.09m49m +
, http://dbpedia.org/resource/Hash_trie +
, http://sr.dbpedia.org/resource/He%C5%A1_stablo +
, http://www.wikidata.org/entity/Q5678860 +
, https://global.dbpedia.org/id/4kjY3 +
|
| rdfs:comment |
In computer science, hash trie can refer t … 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" to perform efficient lookups and updates"
|
| rdfs:label |
Hash trie
|
