6 Comments
User's avatar
Prathamesh Chavan's avatar

Nice 👍

Expand full comment
Gaurav Poudel's avatar

Nice one

Expand full comment
Tony's Blog's avatar

Great post, seeing some things come up again and again.

Expand full comment
Abhay Bhandari's avatar

Insightful.

Expand full comment
Ravi Yadav's avatar

When you talk about fast look ups with Trie, how does it take less time checking in DB?

If DB itself uses Trie data structure, then it makes sense.

If someone explains it here, it’ll be really helpful.

Expand full comment
Ashish Pratap Singh's avatar

Trie is usually stored in-memory while DB fetches from disk. That's why trie is usually faster. Also, trie works in O(m) where m is just the length of the string which is lot faster. Many relational databases O(log N) time for lookups after indexing, where N is the number of records.

Expand full comment