| http://dbpedia.org/ontology/abstract
|
A bitwise trie is a special form of trie where each node with its child-branches represents a bit sequence of one or more bits of a key. A bitwise trie with bitmap uses a bitmap to denote valid child branches.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Trie_example_with_keys_07_and_42.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
66755516
|
| http://dbpedia.org/ontology/wikiPageLength
|
27921
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1104609501
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Persistent_data_structure +
, http://dbpedia.org/resource/Flyweight_pattern +
, http://dbpedia.org/resource/Category:Articles_with_example_Java_code +
, http://dbpedia.org/resource/Free_list +
, http://dbpedia.org/resource/Database +
, http://dbpedia.org/resource/Search_tree +
, http://dbpedia.org/resource/Bit_array +
, http://dbpedia.org/resource/Unicode +
, http://dbpedia.org/resource/B-tree +
, http://dbpedia.org/resource/Database_index +
, http://dbpedia.org/resource/File:Trie_node_with_bitmap_example.svg +
, http://dbpedia.org/resource/Trie +
, http://dbpedia.org/resource/Time_complexity +
, http://dbpedia.org/resource/File:Trie_example_with_keys_07_and_42.svg +
, http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
, http://dbpedia.org/resource/Hash_array_mapped_trie +
, http://dbpedia.org/resource/Bitwise_operation +
, http://dbpedia.org/resource/64-bit_computing +
, http://dbpedia.org/resource/Information_retrieval +
, http://dbpedia.org/resource/Intrinsic_function +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Articles_with_example_Java_code +
, http://dbpedia.org/resource/Category:Trees_%28data_structures%29 +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Bitwise_trie_with_bitmap?oldid=1104609501&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Trie_node_with_bitmap_example.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Trie_example_with_keys_07_and_42.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Bitwise_trie_with_bitmap +
|
| owl:sameAs |
https://global.dbpedia.org/id/Fqs3u +
, http://www.wikidata.org/entity/Q107284830 +
, http://dbpedia.org/resource/Bitwise_trie_with_bitmap +
|
| rdfs:comment |
A bitwise trie is a special form of trie where each node with its child-branches represents a bit sequence of one or more bits of a key. A bitwise trie with bitmap uses a bitmap to denote valid child branches.
|
| rdfs:label |
Bitwise trie with bitmap
|
