Comments on: Never let a tree do a hash table’s job http://www.shapeshifter.se/2007/05/25/never-let-a-tree-do-a-hash-tables-job/ Mostly miscellaneous technical mumbo-jumbo. Sun, 05 Sep 2010 01:48:46 +0200 http://wordpress.org/?v=2.8.6 hourly 1 By: fli http://www.shapeshifter.se/2007/05/25/never-let-a-tree-do-a-hash-tables-job/comment-page-1/#comment-11 fli Fri, 25 May 2007 17:19:16 +0000 http://www.shapeshifter.se/2007/05/25/never-let-a-tree-do-a-hash-tables-job/#comment-11 Probably nothing, but my experience with them is about null. Would be interesting to see how they perform. Do you have any document pointers? Wikipedia says they are the same as radix trees but for generic input, will I still need to work on the bit level? For example, how many nodes would a 255 byte long key need? Probably nothing, but my experience with them is about null. Would be interesting to see how they perform.
Do you have any document pointers?

Wikipedia says they are the same as radix trees but for generic input, will I still need to work on the bit level? For example, how many nodes would a 255 byte long key need?

]]> By: Colin Percival http://www.shapeshifter.se/2007/05/25/never-let-a-tree-do-a-hash-tables-job/comment-page-1/#comment-10 Colin Percival Fri, 25 May 2007 17:03:59 +0000 http://www.shapeshifter.se/2007/05/25/never-let-a-tree-do-a-hash-tables-job/#comment-10 What's wrong with Patricia trees? What’s wrong with Patricia trees?

]]>