Re:Aguri: Coolest Data Structure You've Never Heard Of
by tptacek on Tuesday January 22, 2008 @03:14PM
(#102399)
I'm sorry, you're talking about a totally different algorithm than I am either here or in the article you're responding to. There's no such thing as a "4 bit PATRICIA" trie. Obviously, if you want to burn memory, you can increase the arity of your tree nodes to "speed up" (heh) fetches.
[ Parent
| on HN ]
There are no comments on this comment yet.