Introduction to Bloomfilters

Published by Mario Oettler on

Last Updated on 3. May 2023 by Martin Schuster

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.

Categories:

https://blockchain-academy.hs-mittweida.de/wp-content/uploads/2021/04/logo_bcam_rgb_gross.png

Welcome

Blockchain Academy

Continue with credential

No account yet?

Powered by Hidy

Register with Hidy


Register
Sign in

We need the following credential to register:

please select:

To create a new account, we need the following data from you:

We would appreciate the following additional information from you for the creation of your account:

Welcome

Blockchain Academy

Continue with credential

Already have an account?

Powered by Hidy

Sign in with Hidy


Register
Sign in

We need the following credential to log in:

please select: