Your channel is one stop shop for SDI prep. Thank you for another great video. Could you please share system design for YELP like service. Cheers!
@jheelparikh5365
4 жыл бұрын
You are excellent at explaining System Design. Watching your videos makes me motivated to learn in depth and my learning experience interesting. There is so much to learn from your videos also shows that you enjoy teaching and sharing your immense knowledge.
@vivekrautela6928
3 жыл бұрын
The b tree indexing has time complexity of O(logn) as it performs binary search, why you told that it takes O(1)?
@cool1000nitin
3 жыл бұрын
Correct. What was explained is caching not indexing but overall video is very helpful. 👍
@Akashkumar-md6rg
4 жыл бұрын
I can't find such a content anywhere on KZitem. These videos shows the hard work behind it. U r really great. Thnq very much..🙌🙌
@madhu9829
5 жыл бұрын
How do you gather such in-depth details of these systems? Really great work and I'm enjoying it.
@TechDummiesNarendraL
5 жыл бұрын
You can too, keep reading :)
@mmanuel6874
4 жыл бұрын
@@TechDummiesNarendraL what books and resources do you recommend?
@nabanitasen
4 жыл бұрын
@@mmanuel6874 Best place is the papers published by these companies and their tech talks.
@techtea5911
2 жыл бұрын
@@mmanuel6874 Google!
@iitgupta2010
5 жыл бұрын
Grt, its good knowledge on Inverted index search. That' cool. But was expecting bit more on Actual design. System diagram flow etc.
@janabodu3392
4 жыл бұрын
Can you please increase the volume, its hard to listen from my laptop.. Noticed same thing with your previous videos as well.. But Nice and informative videos..
@weekendresearcher
5 жыл бұрын
So basically, it is a great video!
@mauricruzeiro1
4 жыл бұрын
Basically 😂
@manjushamanjusha
4 жыл бұрын
😂😄
@animatedzombie64
3 жыл бұрын
Basically it is
@kumarc4853
3 жыл бұрын
Narendra Sir is a Legend KZitemr in Sys Design. Very Thorough and knowledgeful videos
@ArvindChourasia
2 жыл бұрын
What an amazing simplified explanation of such a big concept. Thanks for sharing your knowledge.
@rahulsadanandan5076
4 жыл бұрын
Once that "basically" sets in,it's hard to get over
@RanjuRao
3 жыл бұрын
I literally counted how many times "basically" is used. I appreciate the fact that people like him are coming out of their way to contribute to society ,but it would have been more of a sounding content iff this was planned and represented even more methodologically.
@bvsivakrishna
2 жыл бұрын
"Basically" I got your point brother! 😂
@raviprakashagrawal9478
5 жыл бұрын
This guy has done so much hard work to provide free education. Still, a few people disliked this video. Shame on them.
@lalithak6323
2 жыл бұрын
Can't explain in words how much useful is this video, thanks a lot!!!
@kambalavijay6800
3 жыл бұрын
@Tech Dummies Narendra L, it's ok to build a matrix for 3 documents. How about a case where there are a billion docs to scan through and build an inverted index matrix. The matrix would be huge right?
@brijeshshirodkar8784
4 ай бұрын
really enjoyed the illustration of Indexing
@swaroopjin
4 жыл бұрын
Its a great video Naren.. but would like to understand how does refactor/removal of index/keyword happens, also does the Google store index across multiple regions eg: APAC, AMERICA... How big the index can be incase of the Google
@Kasatankit
3 жыл бұрын
Bhai you are awesome!!! I cleared so many interviews because of you!! Sending you more power and may all your wishes come true!
@MargiPatel-o9h
11 ай бұрын
Thank you for sharing! Very clear and learner centered. What an amazing educator!
@phamquangvi4413
2 жыл бұрын
Thank you for your interesting video. Thank a lot.
@kumarch4027
2 жыл бұрын
How the millions of queries will be searched over Reverse index . How the concurrency achieved ? Union and intersection where it is happening and how quick it is . Can query go to the exact shards based on query words and perform union ?
@poonamgoel8993
4 жыл бұрын
Very much informative, thanks for posting this video. One question: is this how all search engine works eg: Windows File System Search, outlook/gmail search, web search?
@v.karikaran5973
3 жыл бұрын
how you learn this thing can you please suggest any book to refer, how search engine work how to build it
@NitishSarin
5 жыл бұрын
You sir, are a legend! 🙏🏻
@TechDummiesNarendraL
5 жыл бұрын
Am just a normal guy !!
@veenuvinod1
2 жыл бұрын
Bro , you are doing such a great work that too free of cost.
@harishwarreddy9114
4 жыл бұрын
While watching the video i can observe increase in my knowledge .What an explanation!
@goutamkreddy
3 жыл бұрын
Nice work with laying out the basic building blocks if any search engine! (especially, the inverted index section)
@ganeshmain009
5 жыл бұрын
Great content on this channel bro..keep up the good work
@524emon
3 жыл бұрын
Great content ... great explanation ... it is difficult to find such content on youtube.
@shivampradhan6101
4 ай бұрын
can you make a new video, since i think searching has moved quiet ahead from tf idf to gen ai embeddings and rag methods
@kslsantosh
5 жыл бұрын
Nice explanation :) , one small suggestion where the order of the words matter is for example query: "Distance between Mumbai to Delhi". This video helped me to brush up information retrieval techniques.
@cliffmathew
Жыл бұрын
When you type "Distance between Mumbai to Delhi", I guess the expectation is to get a number ("26 hr (1,419.7 km) via NH 48") as an answer, and not the documents containing those words. Essentially, we would like the search engine to understand the meaning of our question, and then respond with a factual answer. I suspect that is handled by different techniques like "Semantic search" or "extractive question answering".
@hishu567
5 жыл бұрын
Great article. Keep these coming, Sir :)
@ricardob.18
Жыл бұрын
Amazing video!
@saurabhtyagi6963
2 жыл бұрын
Make bit indexing between words and docs and then it will be easy to do conjuction and disjunction
@chaosu2755
3 жыл бұрын
If there are millions documents have these words. You cannot run intersection in memory. That is one critical part we need focus on. How to make it work?
@vamshiabhilash
4 жыл бұрын
this is really informative and thank you for the kn0wledge this will really be helpful for me as I'm into digital marketing Thank you do much sir really loved the way you explained
@optimizer_____2420
4 жыл бұрын
Very nice explanation sir 👍. Thank you very much.
@akashjkhamkar
Жыл бұрын
really cool video man, keep such videos coming !
@20frieza
5 жыл бұрын
Great Video again Narendra! I am not sure what is the purpose of frequency in this table. It looks like we will never use it when querying. Also why cant the data structure to store the index be Map. This way you can have very fast lookups. But I agree you cant do regex type matching in it.
@cliffmathew
Жыл бұрын
I suspect the frequency is used to understand the semantics. A word and words that appear together or frequently around it are all useful information to gauge the relevance of a document.
@adithyaks8584
3 жыл бұрын
Very good channel I am enjoying every bit of learning here !
@anastasianaumko923
Жыл бұрын
Very clear! Thank you so much for your work 😌
@ankitjain8255
3 жыл бұрын
Such an amazing video, thank you so much Narendra.
@shubhambansal5487
5 жыл бұрын
Great job!! One important suggestion. Use external microphone to cut off background noise and better sound quality. Otherwise your Hard work would not be paid off.
@TechDummiesNarendraL
5 жыл бұрын
Sure, I will have to buy one
@大盗江南
3 жыл бұрын
amazing.........just amazing......thank u narendra!!!
@dataguy7013
4 жыл бұрын
@NArendra, thanks for the detailed explanation. Nice work. So if there ia a new document with the word borwn, how do you update the index? IS updating the index more expensive? Can you do incremental load of the index?
@sagartyagi2450
3 жыл бұрын
How does fuzzy search works? What if I write Quock instead of Quick? How does that comes as a result?
@rahulsharma5030
3 жыл бұрын
how can we update this table when new stuff is added?Shall we store it in redis/cache to speed up?
@GopalRoy-nn6ft
5 жыл бұрын
I don't think u have included technical concept. And technology they use.
@sanjeebkumargouda1471
3 жыл бұрын
Great Lecture sir !!! I enjoyed listening and learning😇😇
@mityabor
4 жыл бұрын
Nice explanation of TF-IDF preprocessing. But not clear how ranking and ML are organized
@subee128
Ай бұрын
Thanks
@prasadjayanti
2 жыл бұрын
good explaining ...
@lokesh4585
3 жыл бұрын
What if we search for "Jumped", Do we expect search engine to lemmatize search keyword?
@AP-tz1ns
Жыл бұрын
really good video
@eugnsp
4 жыл бұрын
Suppose that words "quick", "brown" and "fox" are associated with millions of documents. How would you find an intersection of them in a fraction of a second?
@ers-br
2 жыл бұрын
Just compare the 'bits' ...
@sujataroychowdhury178
5 жыл бұрын
Great Video for explaining the nitty gritty details of inverted search. If you at least show the full flow of the design, would be much appreciated .
@yzmashuai
5 жыл бұрын
Thx Narendra for this wonderful eposide
@MoonsuKang
5 жыл бұрын
Great contents. Thanks for your video.
@rahulsharma5030
3 жыл бұрын
Awesome stuff.One doubt: in last minutes prefix search, i think if we store keys by sorted order.it will make insertion complex,search through the table using binary search and then insert.Btrees/trie can be used but they are not as efficient to search as hash.what we can do is to search jum(a) jum(b) and so on upto z.Since there are 26 apphas and limited number of character apart from alpha.It is more efficient than maintaining sorted list.
@realgabreal
Жыл бұрын
jum* doesnt tell us how long the word would be so just searching for jum(a), jum(b) and so on would not work I think
@AbhishekSharma-bg7ez
3 жыл бұрын
Thanks for the great video and explanation. There is an issue in the term document table. Word "Quick" appears twice in that table at row0 (as Quick) and row8 (as quick) but has different values. this is bit confusing as I am not sure if I am missing something.
@atulsinghrajput9932
2 жыл бұрын
yes , you can to toLowerCase() , its was a mistake. you can ignored that
@ashish161087
4 жыл бұрын
Wow..You are great..
@chiragkataria4161
3 жыл бұрын
Great content man, well explained, only suggestion is to work on audio quality, even after max volume its not properly audible
@esakkisundar
2 жыл бұрын
Out of topic, did you ever wondered the information retrieval from your brain. You can bring back the incident/emotions/moments in milliseconds and the brain is not power intensive at all. What an amazing design our brain has.
@JasonBechervaise
2 жыл бұрын
The brain operates at about 20 watts; this is about 30% more than a Raspberry Pi 4B at theoretical consumption (5V @ 3A = 15w)
@panprasanta
3 жыл бұрын
can you shed some light on how intersections are performed when you have billion of docs ?.
@mohamedamr9203
4 жыл бұрын
thank you its a great video
@adamhughes9938
4 жыл бұрын
If you put a donation link on your videos I would send you money at this point, your vids have helped me so thouroughly!
@prabhatkumarsahu3115
4 жыл бұрын
Great super explanation...
@rahulsoni-lx5rb
8 ай бұрын
🤩🤩🤩
@priyaravindran4337
3 жыл бұрын
Awesome 👏
@anchaldubey4217
5 жыл бұрын
Very nice explanation sir
@waelalghazouli8024
4 жыл бұрын
Very helpful, thank you very much!
@MrQuadraaa
3 жыл бұрын
Top content. Thank you!
@sandeepbatchu487
5 жыл бұрын
What is the point of storing frequencies?
@carrotcarrorfarm
4 жыл бұрын
it is relevant the search result rank. tf-idf, bm25 concept will help you
@raselahmedb
4 жыл бұрын
Best explanation. Please upload POS system.
@rahulsrivastava1603
Жыл бұрын
You earned a sub Sir
@adamhughes9938
4 жыл бұрын
So great
@bharathpreetham2840
5 жыл бұрын
nice explanation😊
@w.maximilliandejohnsonbour725
4 жыл бұрын
Nice info...!!!!!.
@roshankumar0911
4 жыл бұрын
Awesome explanation :-)
@somerandomguy000
3 жыл бұрын
Basically this is a video on how to use basically in all sentences you say
@theultimaterelaxation6839
3 жыл бұрын
Thank you so much.
@vrushtijoshi92
5 жыл бұрын
This was really helpful. Thank you so much. :)
@abhaytiwari6411
4 жыл бұрын
bhaut acha guru
@balakrish3387
4 жыл бұрын
Great content... Voice not so clear
@vijaykumar-yq7sf
5 жыл бұрын
Great
@deep-path-DP
5 жыл бұрын
can we have a video on dream11 architecture
@piotrszkiecin8357
5 жыл бұрын
Your videos are great!
@sushantdev4997
2 жыл бұрын
can't we use a trie here?
@chitthiaayeehai
5 жыл бұрын
Noise removal got slipped ... But it's ok I figured it out... Nice lecture dude.
@helloworld6679
5 жыл бұрын
He did at 17.50
@chitthiaayeehai
5 жыл бұрын
@@helloworld6679 yes yes yes u r rt dude .... Perfect ...
@keshavyadav
3 жыл бұрын
Please improve the audio quality 👏
@pravaskumar7078
5 жыл бұрын
awesome ....
@arunachalamk1145
5 жыл бұрын
Can u make video about networking deeply
@TechDummiesNarendraL
5 жыл бұрын
Some time later :)
@rajparekh08
3 жыл бұрын
Thanks for taking time to make this video. Basically 😂 explained very well .
@EricEric2004
4 жыл бұрын
Basically, the basicality of the basic is quite basical.
@TechDummiesNarendraL
4 жыл бұрын
You got me
@EricEric2004
4 жыл бұрын
Tech Dummies great videos. I love them and subscribed. Thank you 🙏
@bowang1825
4 жыл бұрын
over selling in your title. you can simply say inverted index primer
@faisalmorensya4936
4 жыл бұрын
great video man!
@tanapaul654
5 жыл бұрын
Naren sir please help me how can I contact you I'm really need the design ply
@soniajain7822
4 жыл бұрын
how do u extend this to also show related searches?
@karthik5240
3 жыл бұрын
k-mean clustering
@stevemew6955
3 жыл бұрын
Great video! A bit of trivia - "the quick brown fox jumped over the lazy dog" should have an 's' in it -> "the quick brown fox jumps over the lazy dog". It's a typing exercise to hit all 26 letters. en.wikipedia.org/wiki/The_quick_brown_fox_jumps_over_the_lazy_dog. ;)
Пікірлер: 142