Thursday, March 24, 2005
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST
A 10-MINUTE DESCRIPTION OF HOW JUDY ARRAYS WORK AND WHY THEY ARE SO FAST: "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 used in the 'Judy Scalable Hashing' configuration, Judy is generally faster then a hashing method at all populations."
Subscribe to:
Post Comments (Atom)
Popular Posts
- Yahoo! Mail: Revenge of the Oddpost
- Linux Forum: Apache, Webmin and Mandrake - Linux Operating System Help
- Free AS400 & iSeries Software Tools & Utilities Downloads
- The Laughing Boardroom video...a real world example!
- IBM eServer iSeries - The Laughing Boardroom
- UDATE and *DATE in AS400 RPG
- Sneaky Uses For Everyday Things
- Creating an as400 Query
- What is QZHQSSRV job?
- Difference between SFLINZ and SFLCLR keyword?
No comments:
Post a Comment