Definition
A tiny probabilistic structure answering "definitely not in the set" or "probably in".
How it works
A bit array + k hashes; no false negatives. Used to skip "definitely new" lookups (crawlers, caches, LSM reads) in a few bits per item.
Common questions
What is Bloom Filter?
A tiny probabilistic structure answering "definitely not in the set" or "probably in".
How does Bloom Filter work?
A bit array + k hashes; no false negatives. Used to skip "definitely new" lookups (crawlers, caches, LSM reads) in a few bits per item.
What is Bloom Filter used for in system design?
A bit array + k hashes; no false negatives. Used to skip "definitely new" lookups (crawlers, caches, LSM reads) in a few bits per item.
Part of Glossary on SystemLore — system design explained with 148 deep topics, interactive diagrams, and a build-it-yourself game. Build this one →