Ever wonder how big companies can tell you in a split second that the username you’re trying to create already exists—or that someone else took it? Surely, they’re not checking against a database with hundreds of millions of usernames in real time... or are they? Enter the Bloom Filter—a clever data structure built for speed and scale, using a bit of probabilistic magic to make such feats possible.

In this talk, we’ll explore the inner workings of Bloom Filters, explaining their purpose through storytelling and a memorable analogy that will stay with you forever. Then, we’ll dive into how they’re implemented in Redis and solve real-world challenges at massive scale. This playful yet technical session is perfect for anyone curious about optimizing systems or exploring the secret sauce behind lightning-fast data checks.

https://www.youtube.com/watch?v=C27lZKhiKiA