| • Science | • People | • Locations | • Timeline |
Judy arrays are designed to keep the number of processor cache-line fills as low as possible, and the algorithm is internally complex in an attempt to satisfy this goal as often as possible. Due to these cache optimizations, Judy arrays are fast, sometimes even faster than a hash table.
Roughly speaking, the data structure's designer describes it as similar to a highly-optimised 256-ary trie data structure.