Jump to content

Judy array

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 66.228.92.116 (talk) at 15:16, 23 February 2004 (Complex but fast tree structure.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A Judy array is a complex but very fast data structure for storing data based on a 1-word (32- or 64-bit) key. Unlike a C array, Judy arrays may be sparse. The primary design is to keep the number of processor cache-line fills as low as possible.

How Judy arrays work and why they are so fast.

A complete technical description of Judy arrays.