Editing Judy array (section)

===Speed===
Judy arrays are designed to minimize the number of expensive [[cache-line]] fills from [[random-access memory|RAM]], and so the algorithm contains much complex logic to avoid cache misses as often as possible. Due to these [[CPU cache|cache]] optimizations, Judy arrays are fast, especially for very large datasets. On data sets that are sequential or nearly sequential, Judy arrays can even outperform hash tables, since, unlike hash tables, the internal tree structure of Judy arrays maintains the ordering of the keys.<ref name="nothings">{{Cite web|url=http://www.nothings.org/computer/judy/|title = A performance comparison of Judy to hash tables}}</ref>