Definition: A compact representation of a trie in which any node that is an only child is merged with its parent.
Also known as radix tree.
Generalization (I am a kind of ...)
Specialization (... is a kind of me.)
See also compact DAWG.
Note: A compact directed acyclic word graph (DAWG) merges common suffix trees to save additional space.
A radix tree is taken to be a binary Patricia tree.
Donald R. Morrison, PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric, Journal of the ACM, 15(4):514-534, October 1968.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Stefan Edelkamp, "Patricia tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/patriciatree.html