It's good but it's not the best on TH-cam. There are plenty of videos that all can be the BEST. You just understand this video because you lacked knowledge or understanding of words used in other videos.
This is far and away the best indexing video I have watched. Every other one barely goes into how indexing works under the hood, or use analogies that don't really make sense. Keep up the awesome content!
It’s not that accurate though. He used binary search instead of a B tree (though he did briefly mention it) but I think that misguides the viewer into thinking that’s also what is happening. It also fails to explain the importance of avoiding reading from disk (the whole point of using B trees over AVL or red black trees for example).
More on the performance hit of indices on WRITES. How does it work? Does it: A. Insert the new row in the TABLE (O(1)). Find where the index should be placed (O(logn)), insert it there (O(1)). Or does it: B. Insert the new row in the TABLE (O(1)). Query the whole TABLE again (constant). Sort it again (O(idk)). Save it in the index (O(1)). --- I'm guessing A, but I'm not even sure if that's possible lol. I guess the "finding where the index should be placed" would be the slow part and most likely it would be equivalent as doing the same SELECT query for that column as well? Since you mentioned that SELECT is O(logn): Essentially writes would be O(logn). Would that be, correct?
![[TH] 2024 PMSL SEA W2D1 | Summer | ถ้าไม่พร้อมลุย ได้ไปคุยกับรากมะม่วง](http://i.ytimg.com/vi/XlkKtVvBxac/mqdefault.jpg)
recap:
7:08 full table scan
12:26 binary search
13:56 we shouldn't add index at everything
BEST Indexing explanation video on TH-cam
It's good but it's not the best on TH-cam. There are plenty of videos that all can be the BEST. You just understand this video because you lacked knowledge or understanding of words used in other videos.
This is far and away the best indexing video I have watched. Every other one barely goes into how indexing works under the hood, or use analogies that don't really make sense. Keep up the awesome content!
It’s not that accurate though. He used binary search instead of a B tree (though he did briefly mention it) but I think that misguides the viewer into thinking that’s also what is happening. It also fails to explain the importance of avoiding reading from disk (the whole point of using B trees over AVL or red black trees for example).
Finalyy a tut that really explains what indexes are... The only one till now. Than you!
Now i understand this system design term... Please make more videos on cool stuffs like this.
Great explaination, can you do B-tree and Hash in DB Indexing?
This video explained indexing so simply that I can't forget it ever!!!
whoa! fantastic lesson! More content please!
Study it tooo long ago, recently my boss put me on the spot with ‘what is an index in db’ haha. Now I know, thanks mate. Good video
great tutorial bro, keep it up, good luck to your channel !!
Hands down the best tutorial on index❤
Very good tutorial. Thank you.
Super informational! Thank you.
Very well explained. Thanks for that
Fantastic. Thank you very much.
best video so far
Awesome, thank you.
Hands down best video
This was so helpful. Thank you!
Quality lecture. Thanks...
can you do something like this for mongoDB?
Thank you !
Wow you made this easy. Great video
Now i understand this system design term... Please make more videos on cool stuffs like this. also Tsm
More on the performance hit of indices on WRITES. How does it work?
Does it:
A. Insert the new row in the TABLE (O(1)). Find where the index should be placed (O(logn)), insert it there (O(1)).
Or does it:
B. Insert the new row in the TABLE (O(1)). Query the whole TABLE again (constant). Sort it again (O(idk)). Save it in the index (O(1)).
---
I'm guessing A, but I'm not even sure if that's possible lol. I guess the "finding where the index should be placed" would be the slow part and most likely it would be equivalent as doing the same SELECT query for that column as well? Since you mentioned that SELECT is O(logn):
Essentially writes would be O(logn). Would that be, correct?
Laith, Please do a course on Database
Please. Please. PLEASE
This was a solid explanation
thank you so much
Best video on Indexing
great tutorial!
Amazing!!!😍
Excellent🥳
thank you very much :)
Is this somehow how it works in Windows when it indexes files for file search?
i was watching happily till i read the title
You explained the unexplainable, that calls for the glock glock 3000
If i understand by this video, am i dumb ?
But you don’t have to call me dumb though this is already enough 😞
I don't usually subscribe, but ...
DUMP? Well,....
As a dumb developer I must say I didnt understand.
I hate that you couldn't cut a wait from the animation...