
Creating a Bloom Filter with Go
Creating a Bloom Filter with Go — If you’ve never encountered a Bloom filter before, I recommend having a play as they’re not complicated but are rather interesting in how they let you store data in a performance and memory efficient way, at the price of false positives. Here’s another example of how they work.
Appears in lists (1)
More like this (3)

HyperLogLog
Part of a series onProbabilisticdata structures Bloom filter Count–min sketch Quotient filter Skip list Random trees...

Skip List
Probabilistic data structure Part of a series onProbabilisticdata structures Bloom filter Count–min sketch Quotient filter Skip...

Bloom filters debunked: Dispelling 30 Years of bad math with Coq!
Bloom filters debunked: Dispelling 30 Years of bad math with Coq! FireFox or Chrome warns you...