quad trie

(data structure)

Definition: A tree in which each node is split according to some subset of the key, typically a character.

See also quadtree, digital tree, Patricia tree.

Note: After [GBY91, pages 146-149].

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

Author: PEB

Implementation

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

Entry modified 16 November 2009.
HTML page formatted Tue Dec 6 16:16:32 2011.

Cite this as:
Paul E. Black, "quad trie", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 16 November 2009. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/quadtrie.html