http://judy.sourceforge.net/
From:
http://www.sourceforge.net
Judy Is A C Library That Provides A State-of-The-Art Core Technology
That Implements a sparse dynamic arch.
Is it really as fast as the author?
A Judy Tree Is Generally Faster Than And Uses Less Memory Than
Contemporary Forms of Trees Such As Binary (AVL) TREES, B-TREES,
And Skip-Lists. When buy in the "Judy Scalable Hashing" Configuration,
Judy Is Generally Faster Then a Hashing Method At All Populations.
Anyway, I can't understand the principle of the author:
http://judy.sourceforge.net/doc/10minutes.htm
Leave it first, useful in the future.
