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...
11 KB (1,403 words) - 00:51, 15 August 2024
the O(n log M) space used by an x-fast trie. A y-fast trie consists of two data structures: the top half is an x-fast trie and the lower half consists of...
11 KB (1,418 words) - 02:16, 9 March 2024
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...
31 KB (3,399 words) - 11:30, 23 May 2024
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...
9 KB (912 words) - 16:16, 9 July 2024
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...
27 KB (3,166 words) - 12:09, 21 March 2024
with the x-fast trie, which requires O ( n log U ) {\displaystyle O(n\log U)} space and the same query time, and the more complicated y-fast trie, which...
8 KB (988 words) - 00:51, 15 August 2024
"Self-Adjusting Heaps". SIAM Journal on Computing. 15 (1): 52–69. CiteSeerX 10.1.1.93.6678. doi:10.1137/0215004. ISSN 0097-5397. Tarjan, Robert (1983)...
6 KB (1,447 words) - 00:12, 15 March 2023
Ctrie (redirect from Concurrent hash-trie)
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...
12 KB (1,684 words) - 19:20, 7 June 2023
Suffix tree (redirect from Suffix trie)
compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations...
29 KB (3,703 words) - 10:16, 12 August 2024
early work on the order-maintenance problem, and invented the x-fast trie and y-fast trie, data structures for storing and searching sets of small integers...
11 KB (1,055 words) - 03:06, 18 June 2024
Radix sort (redirect from Bucket trie)
org. Sinha, Ranjan; Zobel, Justin. "Efficient Trie-Based Sorting of Large Sets of Strings". CiteSeerX 10.1.1.12.2367. Retrieved 24 August 2023. R. Sedgewick...
20 KB (2,604 words) - 07:17, 11 June 2024
the nodes at three levels of the trie structure, rather than storing the entire trie. Before building the Luleå trie, the routing table entries need to...
7 KB (1,052 words) - 22:06, 22 February 2024
space on the board permits). Suffix Tree Trie Scrabble Prefix Hash Tree Gordon, Steven A. (1994). "A faster Scrabble move generation algorithm" (PDF)...
4 KB (537 words) - 03:25, 20 March 2023
trie, the time for this algorithm (after the automaton has been constructed) is proportional to the number of nodes in the trie, significantly faster...
5 KB (561 words) - 14:16, 27 September 2023
radix sort, but is faster due to being aware of caching and related radixes being stored closer to each other due to specifics of trie structure. It exploits...
5 KB (528 words) - 06:48, 16 October 2021
possibility is to use only a fixed number of bits per level, which results in a trie. Alternatively, each array may be replaced by a hash table, reducing the...
16 KB (2,354 words) - 22:07, 24 August 2024
Bead sort Bucket sort Burstsort: build a compact, cache efficient burst trie and then traverse it to create sorted output Counting sort Pigeonhole sort...
71 KB (7,827 words) - 18:40, 18 August 2024
The Cloisters (category Articles with FAST identifiers)
are centered around four cloisters—the Cuxa, Saint-Guilhem, Bonnefont and Trie—that were acquired by American sculptor and art dealer George Grey Barnard...
76 KB (9,069 words) - 14:40, 6 July 2024
com/DesaultierMAKK/PersistentBST A persistent hash array mapped trie is a specialized variant of a hash array mapped trie that will preserve previous versions of itself...
42 KB (6,207 words) - 18:16, 25 June 2024
computer and communication network topology Digital tree, prefix tree or trie, a computer science ordered tree data structure The Tree (1969 film), an...
6 KB (702 words) - 01:37, 25 December 2023
B-tree bubble sort bucket bucket array bucketing method bucket sort bucket trie buddy system buddy tree build-heap Burrows–Wheeler transform (BWT) busy beaver...
35 KB (3,137 words) - 03:02, 24 July 2024
Consistent hashing Distributed hash table Extendible hashing Hash array mapped trie Lazy deletion Pearson hashing PhotoDNA Rabin–Karp string search algorithm...
52 KB (5,869 words) - 19:02, 24 August 2024
lookup. Built by storing the suffixes of words. The suffix tree is a type of trie. Tries support extendible hashing, which is important for search engine indexing...
35 KB (4,764 words) - 14:28, 15 August 2024
programming portal Binary tree Blockchain Distributed hash table Hash table Hash trie Linked timestamping Radix tree Becker, Georg (2008-07-18). "Merkle Signature...
15 KB (1,788 words) - 18:26, 28 July 2024
is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing...
11 KB (1,732 words) - 15:04, 29 May 2024
Robert de Courtenay-Champignelles (10 April 1299 – 3 March 1324) Guillaume de Trie (1324–1334) Jean de Vienne (1335–1351) Hugues d'Arcy (1351–1352) Humbert...
49 KB (6,179 words) - 19:40, 16 August 2024
(2001). "Construction of the CDAWG for a trie" (PDF). Prague Stringology Conference. Proceedings. pp. 37–48. CiteSeerX 10.1.1.24.2637. Inenaga, Shunsuke; Shinohara...
55 KB (8,437 words) - 22:49, 22 August 2024
Pavle; Zhao, David; Scholz, Bernhard (2019-02-17). "Brie: A Specialized Trie for Concurrent Datalog". Proceedings of the 10th International Workshop on...
58 KB (4,866 words) - 21:18, 18 August 2024
generated unions), represent the resulting family of sets in a trie, and use the trie representation to test certain candidate pairs of sets for adjacency...
22 KB (2,726 words) - 08:00, 11 January 2024