Re:How Judy arrays work and why they are so fast (2002)
by nudpiedo on Friday August 30, 2019 @02:48AM
(#20836422)
There is no point to compare it with something from 15 years ago, but in that case, the natural competing data structure would have been a Trie, which would have made searches at logarithmic speed (based on path) and saved as much memory as it is possible.
[ Parent
| on HN ]
There are no comments on this comment yet.