Pages tagged datastructure:

A Favorite Data Structure « Rotten Cotton
http://www.onebadseed.com/blog/?p=80

Ullman Set: position[members[i]] = i
Ullman set, an excellent tutorial
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST
http://judy.sourceforge.net/doc/10minutes.htm
As the inventor of the Judy algorithm I've been asked repeatedly, "What makes Judy so fast?" The answer is not simple, but finally I can share all of the details.
A complex (to implement) but efficient scalable data-structure that obtains very high performance by minimising the number of cache-line fills required.
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST
http://judy.sourceforge.net/doc/10minutes.htm
As the inventor of the Judy algorithm I've been asked repeatedly, "What makes Judy so fast?" The answer is not simple, but finally I can share all of the details.
A complex (to implement) but efficient scalable data-structure that obtains very high performance by minimising the number of cache-line fills required.