(data structure)
Definition: A variant of a trie in which leaf nodes are buckets which hold up to k strings. Usually implies fixed sized buckets.
Generalization (I am a kind of ...)
trie.
Specialization (... is a kind of me.)
elastic-bucket trie.
Note: Combining terminal strings can greatly shorten branches. For instance, "extraordinarily", "extraordinariness", and "extraordinary" can be stored in one bucket at the end of a short branch distinguishing them from extran... and extrap... rather than a long branch for the common substring ...ordinar...
Author: PEB
Edward H. Sussenguth, Jr., Use of Tree Structures for Processing Files, CACM, 6(5):272-279, May 1963.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Thu Jan 8 13:08:59 2004.
HTML page formatted Wed Oct 26 09:47:18 2005.
Cite this as:
Paul E. Black, "bucket trie", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/bucketTrie.html
