From ‘Definitely Not’ to ‘Maybe’: Building a Bloom Filter in Java
Ever wondered how Google tells you instantly that a username is already taken? Or how Chrome knows a URL is malicious before you even click it? Checking a database with billions of records for every single keystroke would be a latency nightmare. Instead, these systems use a compact probabilistic structure called a Bloom Filter, one that can definitively tell you something is absent, but can only say something might be present. Today I’m walking through how I built one from scratch in Java, from raw logic to a production-ready generic class, including the math, the non-obvious gotchas, and when you’d actually use this over Guava’s built-in. ...
