Hacker News new | comments | show | ask | jobs | submit login

For me the power of a trie over a hash table has always been the ease of implementation. Hash tables have a lot of corner cases that tries don't have. I can write an entire trie in the time it would take me to just write the part of a hash-table that deals with collisions. Nevermind resizing or rehashing!

This is why Judy arrays seemed a bit odd to me. I feel that if I put as much effort into making a super-fast hash table as the author did into making a super-fast trie, I feel like it would perform as well or better. That's just a gut-instinct though and I don't really have any data to back it up.

I suppose an exception could when the median key length is very short, tries tend to be better since a secure hash function could take longer than a very small number of memory lookups(especially since some of them will be cached).




Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | DMCA | Apply to YC | Contact

Search: