BEST Indexing explanation video on KZread

@jay_wright_thats_right

26 күн бұрын

It's good but it's not the best on KZread. 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.

recap: 7:08 full table scan 12:26 binary search 13:56 we shouldn't add index at everything

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!

@Garentei

11 ай бұрын

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!

i have looked up to many videos and just came across this detailed best explanation

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

This video explained indexing so simply that I can't forget it ever!!!

Now i understand this system design term... Please make more videos on cool stuffs like this.

Hands down the best tutorial on index❤

great tutorial bro, keep it up, good luck to your channel !!

Great explaination, can you do B-tree and Hash in DB Indexing?

whoa! fantastic lesson! More content please!

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?

Super informational! Thank you.

Very good tutorial. Thank you.

Now i understand this system design term... Please make more videos on cool stuffs like this. also Tsm

Hands down best video

Very well explained. Thanks for that

Wow you made this easy. Great video

This was so helpful. Thank you!

This was a solid explanation

Fantastic. Thank you very much.

Laith, Please do a course on Database Please. Please. PLEASE

Best video on Indexing

Increase to 1.5x speed for smoother flow

Quality lecture. Thanks...

best video so far

my kind of content

Awesome, thank you.

can you do something like this for mongoDB?

Is this somehow how it works in Windows when it indexes files for file search?

great tutorial!

I have a program which is doing a lot of queries against a table. The problem is that the program is too slow, and it's updating many records. How can I speed it up? Can i index columns used in searches that is not getting updated? Or does indexing get slow eitherway if i update records in a table with indexed columns?

Thank you !

Excellent🥳

Amazing!!!😍

You explained the unexplainable, that calls for the glock glock 3000

what annotation app are you using

thank you very much :)

i was watching happily till i read the title

thank you so much

Awesome

If i understand by this video, am i dumb ?

But you don’t have to call me dumb though this is already enough 😞

developers could have explained this in 5 mins in very much better way

I don't usually subscribe, but ...

DUMP? Well,....

As a dumb developer I must say I didnt understand.

the title of the video is pretty much embarrassing to click on. Question to me : Am I Dumb ? No So dont click on the video.

I hate that you couldn't cut a wait from the animation...