judy array

In computer science and software engineering, a Judy array is a complex but very fast associative array data structure for storing and looking up values using integer or string keys. Unlike arrays, Judy arrays may be sparse; that is, they may have large ranges of unassigned indices. 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.

External links

<< Previous

Word Browser

Next >>

dave alvin
caroline augusta foley rhys davids
kppen climate classification
baladas en espaol
scale (computing)
irlam
junco
david arnold
happy meal
zastava
uss prairie

idealised population
poetic justice
uss president
common hazel
blue chip
hms president
landing at kip's bay
wol
ladislaus almsy
screwball
black shuck

cavaliers
kurt joss
zymogen
alfred e. neuman
multisource file transfer protocol
broadcast address
temple church
hong kong museum of coastal defence
layton
friedrich wilhelm raiffeisen
pinsk

copeland
fairuz
spiritualist association of great britain
kir bulychev
abrams
anpan
norman e. doyle
woodbine
natanael beskow
tung chung fort
list of people from wisconsin