Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1356176> ?p ?o }
Showing triples 1 to 64 of
64
with 100 triples per page.
- Q1356176 subject Q7035718.
- Q1356176 subject Q8819517.
- Q1356176 abstract "In computer science, a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at least the radix r of the radix trie, where r is a positive integer and a power x of 2, having x ≥ 1. Unlike in regular tries, edges can be labeled with sequences of elements as well as single elements. This makes radix trees much more efficient for small sets (especially if the strings are long) and for sets of strings that share long prefixes.Unlike regular trees (where whole keys are compared en masse from their beginning up to the point of inequality), the key at each node is compared chunk-of-bits by chunk-of-bits, where the quantity of bits in that chunk at that node is the radix r of the radix trie. When the r is 2, the radix trie is binary (i.e., compare that node's 1-bit portion of the key), which minimizes sparseness at the expense of maximizing trie depth—i.e., maximizing up to conflation of nondiverging bit-strings in the key. When r is an integer power of 2 greater or equal to 4, then the radix trie is an r-ary trie, which lessens the depth of the radix trie at the expense of potential sparseness.As an optimization, edge labels can be stored in constant size by using two pointers to a string (for the first and last elements).Note that although the examples in this article show strings as sequences of characters, the type of the string elements can be chosen arbitrarily; for example, as a bit or byte of the string representation when using multibyte character encodings or Unicode.".
- Q1356176 thumbnail Patricia_trie.svg?width=300.
- Q1356176 wikiPageExternalLink kart.
- Q1356176 wikiPageExternalLink concurrent-trees.
- Q1356176 wikiPageExternalLink hat-trie.
- Q1356176 wikiPageExternalLink patl.
- Q1356176 wikiPageExternalLink patricia-trie.
- Q1356176 wikiPageExternalLink cprops.sourceforge.net.
- Q1356176 wikiPageExternalLink trie_8c-source.html.
- Q1356176 wikiPageExternalLink critbit.html.
- Q1356176 wikiPageExternalLink trie_based_containers.html.
- Q1356176 wikiPageExternalLink radix-tree.c.
- Q1356176 wikiPageExternalLink critbit.
- Q1356176 wikiPageExternalLink radixdb.
- Q1356176 wikiPageExternalLink Data-IntMap.html.
- Q1356176 wikiPageExternalLink Data-IntMap.html.
- Q1356176 wikiPageExternalLink 175432.
- Q1356176 wikiPageExternalLink radix-tree-implementation-in-c.html.
- Q1356176 wikiPageExternalLink PatriciaTrieTemplateClass.aspx.
- Q1356176 wikiPageExternalLink PATRICIA.
- Q1356176 wikiPageExternalLink ds.
- Q1356176 wikiPageExternalLink patriciatree.html.
- Q1356176 wikiPageWikiLink Q101244.
- Q1356176 wikiPageWikiLink Q11135.
- Q1356176 wikiPageWikiLink Q1127410.
- Q1356176 wikiPageWikiLink Q1671754.
- Q1356176 wikiPageWikiLink Q17008992.
- Q1356176 wikiPageWikiLink Q17021320.
- Q1356176 wikiPageWikiLink Q17091412.
- Q1356176 wikiPageWikiLink Q175263.
- Q1356176 wikiPageWikiLink Q207440.
- Q1356176 wikiPageWikiLink Q21198.
- Q1356176 wikiPageWikiLink Q22725.
- Q1356176 wikiPageWikiLink Q23808.
- Q1356176 wikiPageWikiLink Q245955.
- Q1356176 wikiPageWikiLink Q2647.
- Q1356176 wikiPageWikiLink Q2680578.
- Q1356176 wikiPageWikiLink Q2859802.
- Q1356176 wikiPageWikiLink Q369377.
- Q1356176 wikiPageWikiLink Q386787.
- Q1356176 wikiPageWikiLink Q387015.
- Q1356176 wikiPageWikiLink Q4423787.
- Q1356176 wikiPageWikiLink Q5000665.
- Q1356176 wikiPageWikiLink Q5280405.
- Q1356176 wikiPageWikiLink Q5421911.
- Q1356176 wikiPageWikiLink Q5678860.
- Q1356176 wikiPageWikiLink Q598841.
- Q1356176 wikiPageWikiLink Q6702792.
- Q1356176 wikiPageWikiLink Q7035718.
- Q1356176 wikiPageWikiLink Q7239860.
- Q1356176 wikiPageWikiLink Q755673.
- Q1356176 wikiPageWikiLink Q80585.
- Q1356176 wikiPageWikiLink Q816826.
- Q1356176 wikiPageWikiLink Q837528.
- Q1356176 wikiPageWikiLink Q843684.
- Q1356176 wikiPageWikiLink Q8795.
- Q1356176 wikiPageWikiLink Q8819.
- Q1356176 wikiPageWikiLink Q8819517.
- Q1356176 wikiPageWikiLink Q92865.
- Q1356176 comment "In computer science, a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at least the radix r of the radix trie, where r is a positive integer and a power x of 2, having x ≥ 1. Unlike in regular tries, edges can be labeled with sequences of elements as well as single elements.".
- Q1356176 label "Radix tree".
- Q1356176 depiction Patricia_trie.svg.