(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.
Author: PEB
Thomas Papadakis, Skip Lists and Probabilistic Analysis of Algorithms, PhD Thesis, Faculty of Mathematics, University of Waterloo, Canada, May 1993, page 106.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 8 January 2004.
HTML page formatted Mon Sep 11 09:46:02 2006.
Cite this as:
Paul E. Black, "elastic-bucket trie", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 8 January 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/elasticBucketTrie.html
