PParminder singh·Nov 4How Instagram checks 1 billion usernames and tells you in milliseconds if yours is freeYou type rahul_07 on a signup page. Before you finish, it says "This username isn't available." Now imagine 1 billion users and a check on every keystroke. Sending every check to the database creates9 min read·systemdesignwithparam.hashnode.dev
OOluwaseyi Fatunmole·Aug 31Bloom Filters Explained: The Probabilistic Data Structure Powering Instagram, Google, and High-Scale SystemsInstagram has over 500 million registered usernames. When a new user tries to register, the platform needs to answer one question almost instantly: has this username already been taken? The naïve answ19 min read·freecodecamp.org
VVictor Alekseev·Jul 3Database synchronization based on Invertible Bloom FiltersDeep dive into Invertible Bloom Filters: the math behind Fivetran's Teleport Sync, peeling decode, rowHash design, and comparison to CDC.61 min read·krocodl.hashnode.dev
AAbstract Algorithms·Jul 2Bloom Filter MembershipLearn how this probabilistic data structure offers instant set membership checks with zero false negatives.1 min read·abstractalgorithms.hashnode.dev
PPrasanth Madhurapantula·Jun 29How a Bloom Filter Works: Build One From Scratch in PythonA Bloom filter gives you something that feels like magic: it can tell you whether an item is in a set of billions, using only a few kilobytes of memory. And it answers in the same tiny amount of time12 min read·freecodecamp.org
RRitik Singh·May 3The Art of the "Maybe": Scaling Systems with Bloom Filters How to save gigabytes of memory and boost database performance using probabilistic data structures.12 min read·ritik-singh-rajput.hashnode.dev
AAbstract Algorithms·May 3Bloom Filters Explained: Membership Testing with Zero False NegativesHow a bit array and k hash functions answer 'definitely not in this set' in O(1) — and why false negatives are mathematically impossible.19 min read·abstractalgorithms.hashnode.dev
AAbhijit Gadhave·May 1The Magic of Bloom FiltersHave you ever tried creating an account on Instagram, Twitter, or Gmail? You type a username like: Abhijit8 …and instantly you get: “Username already taken.” What’s interesting is not the message. I4 min read·abhigadhave97.hashnode.dev
AAbstract Algorithms·Apr 5Probabilistic Data Structures: A Practical Guide to Bloom Filters, HyperLogLog, and Count-Min SketchTrade exact answers for fixed memory and O(1) operations: a comparative guide to Bloom Filters, HyperLogLog, and Count-Min Sketch.14 min read·abstractalgorithms.hashnode.dev
AAbstract Algorithms·Mar 9How Bloom Filters Work: The Probabilistic SetCan you check if a username is taken without querying the database? Yes. Bloom Filters are a space-efficient probabilistic data structure.13 min read·abstractalgorithms.hashnode.dev
