HyperLogLog Explained: Counting Billions of Unique Items with 12 KB
How stochastic averaging over leading-zero bit runs estimates cardinality to ±0.81% using 12 KB of memory regardless of dataset size.
May 3, 202618 min read302

Search for a command to run...
Articles tagged with #probabilistic
How stochastic averaging over leading-zero bit runs estimates cardinality to ±0.81% using 12 KB of memory regardless of dataset size.

How a d × w counter matrix answers 'how often has X appeared?' with a bounded upper bound error and O(1) operations at any stream volume.
How a bit array and k hash functions answer 'definitely not in this set' in O(1) — and why false negatives are mathematically impossible.