2 ms·
I compared it with plain newline separated list of absolute paths, and savings were such that I could not imagine beating it with anything else I knew at the ti
by megous 7y ago
I compared it with plain newline separated list of absolute paths, and savings were such that I could not imagine beating it with anything else I knew at the time, which would have similar characteristics.
The dataset has a lot of shared prefixes, and Judy excels at storing such data.
It was 15 years ago so don't ask me for details.
- nudpiedo 7y agoThere 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.