Why does a naive database query like LIKE 'car%' get slower as the dictionary grows?
The query must scan every row or index entry, comparing the prefix against each one. That's O(N) per keystroke, where N is the full dictionary. A trie answers the same question in O(p), the prefix length, because it jumps directly to the 'car' subtree.
Answered in
Tries: Why Autocomplete Doesn't Scan Every WordA trie finds all words with a prefix in O(p) time, independent of dictionary size. Radix compression and top-k heaps make autocomplete instant.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.