← Wednesday, October 21, 2026DatabasesDeep dive

One Hash Bloom Filters explains a compact probabilistic data structure

calabro.io 6 min read Editor score 6/10

Bloom filters can avoid expensive database lookups; the excerpt says Bluesky uses them to save millions of Scylla queries per second. The production context makes the data-structure trade-offs relevant to engineers building high-throughput systems.

What

A Bloom filter is a compact probabilistic structure that answers whether a key is definitely absent or probably present in a set.

How

It hashes keys to bit-array locations; double hashing derives multiple locations from two hashes while preserving an effectively similar false-positive rate.

Why it matters

Systems engineers can use filters to avoid many slow database lookups, reducing I/O and helping high-throughput services scale.

Read on calabro.io → Hacker News · 14 comments

Headline, summary, brief and diagram are written by a model from the source's own text; the link, byline and numbers come from the source. Read the original before relying on a claim.