elastic-bucket trie

(data structure)

Definition: A variant of a bucket trie in which each leaf node for n strings is a bucket allocated to hold exactly n strings.

Generalization (I am a kind of ...)
bucket trie.

Note: The name comes from reTRIEval and is pronounced, "tree." See the historical note at trie.

Author: PEB

More information

Thomas Papadakis, Skip Lists and Probabilistic Analysis of Algorithms, PhD Thesis, Faculty of Mathematics, University of Waterloo, Canada, May 1993, page 106.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 1 August 2008.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "elastic-bucket trie", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 1 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/elasticBucketTrie.html