Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Radix_tree> ?p ?o }
- Radix_tree 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.".
- Radix_tree thumbnail Patricia_trie.svg?width=300.
- Radix_tree wikiPageExternalLink kart.
- Radix_tree wikiPageExternalLink concurrent-trees.
- Radix_tree wikiPageExternalLink hat-trie.
- Radix_tree wikiPageExternalLink patl.
- Radix_tree wikiPageExternalLink patricia-trie.
- Radix_tree wikiPageExternalLink cprops.sourceforge.net.
- Radix_tree wikiPageExternalLink trie_8c-source.html.
- Radix_tree wikiPageExternalLink critbit.html.
- Radix_tree wikiPageExternalLink trie_based_containers.html.
- Radix_tree wikiPageExternalLink radix-tree.c.
- Radix_tree wikiPageExternalLink critbit.
- Radix_tree wikiPageExternalLink Data-IntMap.html.
- Radix_tree wikiPageExternalLink Data-IntMap.html.
- Radix_tree wikiPageExternalLink 175432.
- Radix_tree wikiPageExternalLink radix-tree-implementation-in-c.html.
- Radix_tree wikiPageExternalLink PatriciaTrieTemplateClass.aspx.
- Radix_tree wikiPageExternalLink PATRICIA.
- Radix_tree wikiPageExternalLink ds.
- Radix_tree wikiPageExternalLink patriciatree.html.
- Radix_tree wikiPageID "1481659".
- Radix_tree wikiPageLength "15414".
- Radix_tree wikiPageOutDegree "42".
- Radix_tree wikiPageRevisionID "674205697".
- Radix_tree wikiPageWikiLink Acronym.
- Radix_tree wikiPageWikiLink Acyclic_deterministic_finite_automata.
- Radix_tree wikiPageWikiLink Associative_array.
- Radix_tree wikiPageWikiLink Balanced_trees.
- Radix_tree wikiPageWikiLink Burstsort.
- Radix_tree wikiPageWikiLink Category:String_data_structures.
- Radix_tree wikiPageWikiLink Category:Trees_(data_structures).
- Radix_tree wikiPageWikiLink Computer_science.
- Radix_tree wikiPageWikiLink Daniel_J._Bernstein.
- Radix_tree wikiPageWikiLink Data_structure.
- Radix_tree wikiPageWikiLink Deterministic_acyclic_finite_state_automaton.
- Radix_tree wikiPageWikiLink Deterministic_finite_automata.
- Radix_tree wikiPageWikiLink Deterministic_finite_automaton.
- Radix_tree wikiPageWikiLink Dictionary_of_Algorithms_and_Data_Structures.
- Radix_tree wikiPageWikiLink Directed_acyclic_word_graph.
- Radix_tree wikiPageWikiLink Extendible_hashing.
- Radix_tree wikiPageWikiLink HAT-trie.
- Radix_tree wikiPageWikiLink Hash_array_mapped_trie.
- Radix_tree wikiPageWikiLink Hash_table.
- Radix_tree wikiPageWikiLink Hash_trie.
- Radix_tree wikiPageWikiLink Hashtable.
- Radix_tree wikiPageWikiLink Huffman_coding.
- Radix_tree wikiPageWikiLink IP_address.
- Radix_tree wikiPageWikiLink Information_retrieval.
- Radix_tree wikiPageWikiLink Interface_(computer_science).
- Radix_tree wikiPageWikiLink Interface_(computing).
- Radix_tree wikiPageWikiLink Internet_Protocol.
- Radix_tree wikiPageWikiLink Inverted_index.
- Radix_tree wikiPageWikiLink Judy_array.
- Radix_tree wikiPageWikiLink Luleå_algorithm.
- Radix_tree wikiPageWikiLink Monash_University.
- Radix_tree wikiPageWikiLink Multibyte_character.
- Radix_tree wikiPageWikiLink NIST_Dictionary_of_Algorithms_and_Data_Structures.
- Radix_tree wikiPageWikiLink Prefix_Hash_Tree.
- Radix_tree wikiPageWikiLink Prefix_hash_tree.
- Radix_tree wikiPageWikiLink Prefix_tree.
- Radix_tree wikiPageWikiLink Radix.
- Radix_tree wikiPageWikiLink Routing.
- Radix_tree wikiPageWikiLink Search_algorithm.
- Radix_tree wikiPageWikiLink Self-balancing_binary_search_tree.
- Radix_tree wikiPageWikiLink Serialization.
- Radix_tree wikiPageWikiLink Ternary_search_tree.
- Radix_tree wikiPageWikiLink Ternary_search_tries.
- Radix_tree wikiPageWikiLink Total_order.
- Radix_tree wikiPageWikiLink Total_ordering.
- Radix_tree wikiPageWikiLink Trie.
- Radix_tree wikiPageWikiLink Unicode.
- Radix_tree wikiPageWikiLink Variable-width_encoding.
- Radix_tree wikiPageWikiLink File:An_example_of_how_to_find_a_string_in_a_Patricia_trie.png.
- Radix_tree wikiPageWikiLink File:Patricia_trie.svg.
- Radix_tree wikiPageWikiLinkText "Patricia trie".
- Radix_tree wikiPageWikiLinkText "Radix tree".
- Radix_tree wikiPageWikiLinkText "Radix tree#PATRICIA".
- Radix_tree wikiPageWikiLinkText "radix tree".
- Radix_tree hasPhotoCollection Radix_tree.
- Radix_tree wikiPageUsesTemplate Template:Anchor.
- Radix_tree wikiPageUsesTemplate Template:CS-Trees.
- Radix_tree wikiPageUsesTemplate Template:Div_col.
- Radix_tree wikiPageUsesTemplate Template:Div_col_end.
- Radix_tree wikiPageUsesTemplate Template:Mvar.
- Radix_tree wikiPageUsesTemplate Template:Portal.
- Radix_tree wikiPageUsesTemplate Template:Reflist.
- Radix_tree subject Category:String_data_structures.
- Radix_tree subject Category:Trees_(data_structures).
- Radix_tree hypernym Structure.
- Radix_tree type Article.
- Radix_tree type Building.
- Radix_tree type Article.
- Radix_tree type Structure.
- Radix_tree type Technique.
- Radix_tree 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.".
- Radix_tree label "Radix tree".
- Radix_tree sameAs Patricia-Trie.
- Radix_tree sameAs درخت_مبنا.
- Radix_tree sameAs Arbre_radix.