Introduction to Bloomfilters

Published by Mario Oettler on

A bloom filter is a probabilistic data structure. The easiest way to understand bloom filters is by learning how to construct them.

The filter basically consists of a binary (its values can be 0 or 1) array of length l. If we want to write a string into this filter, we need to convert this string into one or more indexes of this array. This is usually done with one or more hash functions.

Let’s consider an example.