Patricia trie
|
|
In computer science, a Patricia trie (also known as a radix tree, Crit bit tree, or Binary decision diagram) 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.
External links
- Monash University: Algorithms and Data Structures Research & Reference Material: PATRICIA (http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Tree/PATRICIA/), by Lloyd Allison
- Practical Algorithm to Retrieve Information Coded in Alphanumeric (http://portal.acm.org/citation.cfm?id=321481), original paper in ACM Portal