In computer science, a trie (/ˈtraɪ/, /ˈtriː/), also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for...

radix tree (also radix trie or compact prefix tree or compressed trie) is a data structure that represents a space-optimized trie (prefix tree) in which...

The HAT-trie is a type of radix trie that uses array nodes to collect individual key–value pairs under radix nodes and hash buckets into an associative...

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...

array mapped trie (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie. It is 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...

Trie Utami Sari or also known as Trie Utami or Iie (born 8 January 1968 in Bandung) is an Indonesian singer, composer and pianist. former singer of the...

commune of Villers-sur-Trie was merged into Trie-Château. Charles François Dupuis (1742–1809), polymath and theologian, was born in Trie-Château Communes of...

In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries...

A C-trie is a compressed trie data structure. It achieves lower memory and query time requirements at the expense of reduced flexibility. Maly, K. Compressed...

Trie-sur-Baïse (French pronunciation: [tʁi syʁ ba.iz]; Occitan: Tria de Baïsa) is a commune in the Hautes-Pyrénées department in south-western France....

In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries...

(also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the given text as their keys and positions...

Yah-Lin "Charlie" Trie (崔亞琳) was a $450,000 attempted donation from him to Clinton's legal defense fund (for his impeachment trials) which Trie allegedly delivered...

A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent...

Sainte-Trie (French pronunciation: [sɛ̃t tʁi]; Occitan: Sent Tria) is a commune in the Dordogne department in Nouvelle-Aquitaine in southwestern France...

to the plural form of: Try (rugby) Try, a conversion (gridiron football) Trie, a prefix tree in computer science This disambiguation page lists articles...

Mathieu III de Trie (died 26 November 1344) was a 14th-century French military and political leader. He was the lord of Araines, Fontenay, and Vaumain...

cart in a trie that does not contain cart, but contains art, and thus would fail at the node prefixed by car), to other branches of the trie that share...

In computer science, a ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary...

suffix array FM-index Generalised suffix tree B-tree Judy array Trie X-fast trie Y-fast trie Merkle tree Ternary search tree Ternary tree K-ary tree And–or...

sorting algorithm that combines a binary trie structure with a circular doubly linked list. Efficient Trie-Based Sorting of Large Sets of Strings, by...

Wikimedia Commons has media related to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure...

given to Mathieu de Trie, maternal grandson of Aubry III of Dammartin. Mathieu de Trie (1262–1272), son of Jean I, seigneur de Trie and of Mouchy, and...

update operations to change the underlying alphabet: the Wavelet Trie exploits the trie structure on an alphabet of strings to enable dynamic tree modifications...

are centered around four cloisters—the Cuxa, Saint-Guilhem, Bonnefont and Trie—that were acquired by American sculptor and art dealer George Grey Barnard...

Villers-sur-Trie (French pronunciation: [vilɛʁ syʁ tʁi]) is a former commune in the Oise department in northern France. On 1 January 2018, it was merged...

In computer science, a hash tree (or hash trie) is a persistent data structure that can be used to implement sets and maps, intended to replace hash tables...

Trie-la-Ville (French pronunciation: [tʁi la vil]) is a commune in the Oise department in northern France. Communes of the Oise department "Répertoire...

Lalanne-Trie (French pronunciation: [lalan tʁi]; Occitan: La Lana) is a commune in the Hautes-Pyrénées department in south-western France. Communes of...