Re:Fast Perfect Hashing
by chubot on Wednesday February 13, 2019 @12:26PM
(#19154717)
The algorithms presented below are much faster than most non-perfect hash functions on recent CPUs.
This is a very vague statement. I would like to see some numbers, as well as real-world use cases.
Last month there was a thread about perfect hashing in the postgres parser, but I wonder if a DFA / trie is better, since you don't have to always look at every byte.
This is a very vague statement. I would like to see some numbers, as well as real-world use cases.
Last month there was a thread about perfect hashing in the postgres parser, but I wonder if a DFA / trie is better, since you don't have to always look at every byte.
https://news.ycombinator.com/item?id=18880374