Science Fair Project Encyclopedia
In computer science, a Patricia trie (also known as a radix tree) is a simple form of compressed trie which merges single child nodes with their parents. Its name comes from the acronym PATRICIA, which stands for "Practical Algorithm to Retrieve Information Coded in Alphanumeric", and was described in a paper published in 1968 by Donald R. Morrison . Patricia tries are useful for constructing associative arrays with integer keys.
- Monash University: Algorithms and Data Structures Research & Reference Material: PATRICIA, by Lloyd Allison
- Practical Algorithm to Retrieve Information Coded in Alphanumeric, original paper in ACM Portal
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details