Quote: use burst trie for sorted data; containers (e.g., binary tree) accessed by a trie; better performance than binary tree, splay tree, ternary tree; only 25% slower than hash table

Quotation Skeleton

In this paper we propose a new in-memory … structures, which we call containers, that are accessed … first few characters of a query string to … in the container. A container can be any … a binary search tree. … When a container is deemed to be inefficient, … that, between them, partition the original container's strings. … [p. 194] As the experiments show, a burst trie … table, uses no more space than a conventional … fastest variant of a burst trie can accumulate … time, while using no more memory. Compared to … the memory. … [p. 199] [Since] the most common words are typically … [they] are found after simply following a small …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: suffix trie (18 items)