raghu@dark-factory :~/kb/bloom-filter $ cat

Bloom Filter

A space-efficient probabilistic set-membership structure answering 'definitely absent / possibly present' to skip unnecessary disk reads, used to prune SSTable lookups in LSM-tree engines.

grounded in: HN trend theme 'Databases and data-plane performance' (squeezing throughput out of SQL infra); a lasting technique tied to the existing lsm-tree concept

Connected concepts

LSM-tree, Storage engine

Explore it live in the knowledge graph →