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
- Java Examples - JExamples.com
- AS400 Job Scheduler
- Using QCLRDTAQ to clear data queues in CL and RPG
- Library list for Web server
- as400 commands and APIs you'll use for handling messages
- About Us
- Creating an as400 Query
- ibm as400 manuals v5r4
- What is QZHQSSRV job?
- XMLHttpRequest & Ajax Working Examples - Links and Resources, Fiftyfoureleven.com
No comments:
Post a Comment