I found this article more than just very interesting, I found it mind numbingly simple and once I thought about it, very obvious. Truth is, I'm as guilty of not thinking about page faults and access times when I develop my trie's as anyone out there. Time to go back and pay a bit more attention to my basic implementations. A few minor tweaks could speed up your seek times x10!

Would you believe me if I claimed that an algorithm that has been on the books as "optimal" for 46 years, which has been analyzed in excruciating detail by geniuses like Knuth and taught in all computer science courses in the world, can be optimized to run 10 times faster?

http://queue.acm.org/detail.cfm?id=1814327
- Jeremy