If i Would like to search for a name called "Martin" ,because "Martin" is a duplicate VALUE ,so whether it give three rows data which contains name "martin" ?and also i have a question that i want data for martin ,how can i find that which martin i am searching for?
after watching this video i got an idea how index works in background.......and best video in RUclips i have ever seen........... thankyou so much sir
I have been trying to understand indexes for a while now. This video did a great visual explanation. Thank you.
The gold standard for this topic -- VERY NICELY DONE!! Thank you! :o)
9 years old and it still holds up
😊
This is the best explanation so far. Thanks a heap! 😉
one of the best videos on indexes
Excellent, thanks for putting in an actual example. Good job.
Ideal, thank you, i did not know many things about indexes, now I know
Nicely explained . Thanks so much !
this is awesome !! Perfect one
Why would you ever choose the values of the leafs to be keys to the clustered index over pointers to the heap?
Thanks for the video..
Thanks.... excellently explained
Very well explained, but I nearly fell asleep...
Great explanation
Thankyou 🙏😊🙏😊🙏
great video,
Golden explanation
where did you get this from? is this part of a series?
Nice Video. Can you explain Multi Column Index in B Tree from?
This is very helpful, thanks a lot.
at 5:01 minute in the video ,Rudd>=Akthar= TRUE ? Rudd has 470501 and Akthar has 470601 ,So which one is greater ? am i missing something ???
He is comparing the actual values of "Rudd" and "Akthar", the text / string, not their corresponding pointer values (470501 and 470601).
Its checking alphabetical comparsion
Nice explanation...
Very well explained..
If i Would like to search for a name called "Martin" ,because "Martin" is a duplicate VALUE ,so whether it give three rows data which contains name "martin" ?and also i have a question that i want data for martin ,how can i find that which martin i am searching for?
murthy mamidi
If you searched for just martin, you would get all the martins
Good explanation
Data on the leaf level in the clustered key is stored sorted logically, not physically.
correct
It means it's also in sorted in ascending order ?
No, it's stored physically for Clustered Indexes
1:05
where i am can find full course?
Explain columnstore index
Well understood. Thanks
Gud One...
Perfect
WOW
iyhoooo! understood
ok very good
good
Ausgezeichnet
Thankyou 🙏😊🙏😊