Bloom Filters
samwho.dev · 3,038 words · saved by 1 readers
A visual, interactive guide to what bloom filters are, when you would use them, and how they work.
Everyone has a set of tools they use to solve problems. Growing this set helps you to solve ever more difficult problems. In this post, I'm going to teach you about a tool you may not have heard of before. It's a niche tool that won't apply to many problems, but when it does you'll find it invaluable. It's called a "bloom filter." Before you continue! This post assumes you know what a hash function is, and if you don't it's going to be tricky to understand. Sam has written a post about hash functions, and recommends that you read this first . # What bloom filters can do Bloom filters are simil
related reading
- Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyterboyter.org
- Bloom filter | Docsredis.io
- Bloom filters debunked: Dispelling 30 Years of bad math with Coq!kirancodes.me
- How a Kalman filter works, in pictures | Bzargbzarg.com
- Visualizing Algorithmsbost.ocks.org
- In defense of blub studies | benkuhn.netbenkuhn.net
- Faster phrase search with shingled bloom filters in Brainstorebraintrust.dev
- Build Your Own Databasenan.fyi
- p197-wang.pdfvldb.org
- But what is a convolution?youtube.com
- Introduction to Locality-Sensitive Hashingtylerneylon.com
- Breadth-first search - Wikipediaen.wikipedia.org