How do "Suggested Usernames" actually work?

We’ve talked about Redis Hashes for storage and Bloom Filters for the "Bouncer" at the door. But what happens when ateebHussain is taken and you need to suggest: ateebHussain_1 ateebHussain_pro ateeb_h If you try to do this with LIKE %ateeb% in a SQL database with 10 million rows... RIP your latency. Enter: The Trie Structure (Prefix Tree) A Trie is a specialized tree used to store associative arrays. Instead of storing whole strings, it stores characters as nodes. Imagine it like a path: A -> T