Probabilistic data structures

Bloom
Filter Lab

Explore a compact membership structure that permits false positives but no false negatives under correct operation.

Bit-array sample

256 sampled positions from the current bit array.

Query

Inserted values

Bit density

Bits (m)Hash positions (k)

Measured false-positive rate

—

Theoretical approximation

—