Creating a Bloom Filter with Go

By Dylan Meeus.

View original

Excerpt: A bloom filter is a set-like data structure that is more space-efficient compared to traditional set-like data structures such as hash tables or trees. The catch is that it is probabilistic, meaning…