User: Password:
Subscribe / Log in / New account

Trees I: Radix trees

Trees I: Radix trees

Posted Mar 19, 2006 8:09 UTC (Sun) by ncm (subscriber, #165)
Parent article: Trees I: Radix trees

The designer of Judy trees has expressed wonder at why anybody ever talks about binary trees (e.g. red-black trees) any more, since his measurements indicate that no matter what you do, their performance always stinks compared to modern cache-aware techniques. The only reasonable explanation is the same as the reason university graduates, once, all knew ancient Greek, and had studied geometry but not calculus.

(Log in to post comments)

Trees I: Radix trees

Posted Jun 30, 2006 23:22 UTC (Fri) by wahern (subscriber, #37304) [Link]

The author/inventor put it well himself when he said, "Well I cannot describe Judy in 10 minutes -- what possessed me?"


Simplicity is often a very valuable quality, especially in software development.

Judy licensing

Posted Jul 18, 2007 7:59 UTC (Wed) by iler (guest, #46313) [Link]

Another reason, besides simlpicity, is licensing.

Is Judy GPLed ?

Judy licensing

Posted Oct 23, 2008 21:31 UTC (Thu) by bcl (subscriber, #17631) [Link]

LGPL according to the article linked above

Trees I: Radix trees

Posted Jul 22, 2013 10:25 UTC (Mon) by puchuu (guest, #92032) [Link]

Judy author sold himself and his ideas to HP. Why linux should collect HP patents? (see USA patent 6735595)

Also the fastest hash table in the world is "burst trie", not judy arrays. Linux can use fork of "burst trie" idea named "hat trie" in future. It is more memory efficient. These ideas are free, no patents.

Copyright © 2017, Eklektix, Inc.
Comments and public postings are copyrighted by their creators.
Linux is a registered trademark of Linus Torvalds