Re:Bloom Filters: More than a space-efficient hashmap
by thomasmg on Wednesday August 11, 2021 @10:01AM
(#28142072)
I'm sorry! I thought this implementation uses linear probing. Yes this is not an example of linear probing. But it is much closer to linear probing than to cuckoo hashing (I hope we can agree on this). I also found this blog entry interesting: https://probablydance.com/2017/02/26/i-wrote-the-fastest-has... (of course "fastest" is relative, when it comes to benchmarks)
[ Parent
| on HN ]
There are no comments on this comment yet.