News for hackers. Stuff that matters.

A comment on String Interning – Trie vs. Hash Table Deathmatch. Parent comment

Re:String Interning – Trie vs. Hash Table Deathmatch by tgarv on Monday June 29, 2015 @04:31PM (#9800798)
Yeah that's definitely the case. This test was for string interning though, so I assume the prefix checking wasn't really necessary so the trie doesn't gain any advantage from having that capability (though I admit I wasn't familiar with the concept of string interning before reading this post so I could be missing something).
[ Parent | on HN ]
Re:String Interning – Trie vs. Hash Table Deathmatch by alienasa on Monday June 29, 2015 @04:45PM (#9800906)
It seems to be that you've hit the nail on the head:

Hash Tables are faster than Tries when your only requirement is that you don't duplicate storage.

[ Parent | on HN ]