News for hackers. Stuff that matters.

A comment on Use perfect hashing, instead of binary search, for keyword lookup. Parent comment

Re:Use perfect hashing, instead of binary search, for keywor... by sanxiyn on Friday January 11, 2019 @02:52AM (#18881685)
Yes, you probably shouldn't use any kind of binary trees. This has been a sort of open secret for years. I first learned about it from phk(Poul-Henning Kamp)'s 2010 article, "You're doing it wrong". See http://phk.freebsd.dk/B-Heap/queue.html.
[ Parent | on HN ]
Re:Use perfect hashing, instead of binary search, for keywor... by lkuty on Friday January 11, 2019 @06:46AM (#18882799)
What would you recommend as a good book on Virtual Memory ? I learned about the insides of computers during school days more than 20 yers ago and I would like to refresh/update my knowledge.
[ Parent | on HN ]
Re:Use perfect hashing, instead of binary search, for keywor... by senderista on Friday January 11, 2019 @05:49AM (#18882488)
AKA how to reinvent cache-oblivious data structures, poorly.
[ Parent | on HN ]
Re:Use perfect hashing, instead of binary search, for keywor... by sanxiyn on Friday January 11, 2019 @10:35AM (#18884185)
Yes, I don't think the article is very good, but it was where I first learned whole IO complexity thing, and I think it was widely read and effective in popularizing the idea.
[ Parent | on HN ]