Indexing in database example | DBMS | Lec-71 | Bhanu Priya

[@SathishKumar-bw5zu]

Perfect mam. You taught us with a lot of examples to practically understand it. don't give heed to others, they always wanted graphic-based teaching, but fail to notice the gems

[@indexima6517]

hey!! We invite you to follow us and take a look at our videos which deal with the same topics :)

[@arts.maimounah]

Thank you 😍👌 very easy to understand

[@amjad3723]

thank you so much for everything you are doing here in your channel you have helped me sooo much I can't thank you enough

[@robsonsilv4.]

Good channel and explanation!

[@TrendyTravelStories555]

Nice explanation mdm

[@advaithrvasistha44]

how is the index being compared..eg if i want to search roll no record from a students table where there are another 10 blocks in db,how is the primary key of students table being compared to index ?

[@DatabaseTopicsandTech]

for DBMS and SQL SERVER lectures please join

[@ranganathvangari6373]

about Hash based Indexing and Tree based Indexing?
Can You do a video on this two topic Mam no one is done on this topic

[@MounikaDonga-r5s]

Yes... My sem exam is on tmrw😢

[@aniketdeshmukh4990]

Thank you

[@johnson1674]

what is candidate key (key)

[@jatinpatti9450]

primary key is also know AS candidate key bro😊

[@DatabaseTopicsandTech]

nice expalnation

[@Prassu_vlogss]

Tqs ma'am

[@gateeasycse]

Index stored in Ram or hard-disk?

[@pratikshapuri8254]

Hard disk

[@ishara8375]

Where is cutex???

[@MaheshKumar-ei8jv]

Why hashing is not there??

[@coffeedude]

You can't order the elements in Hash Table, this method is used to search in ordered arrays

[@advaithrvasistha44]

@@coffeedude so the rows are stored sequentially?

[@coffeedude]

They are typically stored in a B-Tree or B+ Tree data structure, which has all its elements ordered while making search efficient. On disk they do not need to be physically together but they can. @@advaithrvasistha44

[@asakurami2334]

Go to the backside of the textbook. So kinky