5.5 Primary Indexing In DBMS In HINDI Part-1

[@KNOWLEDGEGATE_kg]

For complete DBMS, check out this video: th-cam.com/video/YRnjGeQbsHQ/w-d-xo.html

[@noobscientist6729]

Lol. This is exactly what my teacher taught me in the university. Same diagram same concepts. Now I know where she learns from :p
Thanks @Knowledge Gate :)

[@AvinashSingh-bk8kg]

I couldn't control my emotions after reading your comment 😂😂

[@dailynewfilm]

Same

[@goldblack3475]

Same in my college also. 😀

[@jenilgathani7782]

Great explanation. I have been watching your DBMS videos and you teach each and every concept in great detail which is really awesome.Keep making new videos, cheers.

[@uditgupta6997]

Beautifully explained.

[@adityasharma7342]

your lectures are extremely helpful, hope your channel gets a lot of subs and keep up the good work

[@DhakadSir]

nice sir , good Explained ..thanku so much sir..

[@rahulbajaj5567]

Sir, You are extremely efficient

[@KNOWLEDGEGATE_kg]

thanks a lot rahul boss....

[@LSTechnicalEducation]

good Explained ..thanku so much sir..

[@kavita_maheshwari]

Thanku sir,it's helpful

[@Ankit-we8ym]

thanks Sanchit sir
your explanation is lucid and easy
thanks and respect

[@KNOWLEDGEGATE_kg]

pleasure is entirely mine ankit bhai enjoy...

[@sanjanakadam7280]

thank you so much it was really helpful

[@sssonukumargupta2997]

Thank u sir for teaching me

[@vikalpmishra2018]

you are great sir

[@kaushalnijhawan9626]

sir awesome explanation !!

[@KNOWLEDGEGATE_kg]

thanks a lot kaushal bhai, god bless you...

[@jayeshjadhav3024]

Sir, In some books I found that Dense and Sparse both are the types of primary indexing?

[@sandeepmalviya100]

Good explanation ...

[@KNOWLEDGEGATE_kg]

thanks a lot me bhai.....

[@pankajpawar3070]

good explanation thank u

[@amalprasad3418]

sir, one doubt...can primary indexing be both sparse and dense index?

[@anjithaprakash43]

Good explanation.Please do videos in English

[@rishabhjain7313]

When there are n blocks of Index file and we are applying binary search on that n blocks then the result will be the desired indexed block in which we need to again search for the block pointer of desired block of record and then we can access the record of main file.So is the formula =log(n)+log(no. of records in each block)+1?
Please clarify?

[@maryadalodha9798]

no of records are very few. so ignored

[@newerastudio1604]

sir ap please compiler design ka video upload kijiye

[@RaviSingh-yf6jd]

Thanks sir

[@prasuntiwari4291]

Can two attributes together form a search key in Primary Indexing?

[@narendraparmar1631]

thanks sir for this video😃

[@yashpalgupta7859]

sir ur explanation is too good, thanks a lot..one request sir plz can u provide material for b tree and b+ tree, urgent in need ..

[@KNOWLEDGEGATE_kg]

thank you very much yashpal bhai, our team is working on material as well

[@manishkumartiwari7906]

Nice

[@Arun-qk3yo]

Can we get the full course sir

[@zakiprince2750]

When the block size and index size are equa!l then why are we applying binary search on index file ? can't we directly apply on main file which will also save the time of indexing too??

[@AjeetKumar-he9lk]

The size of the main file is quite large when compared to the index file. So, when compared to the main file, nos of blocks occupied by index file will be lesser (in fact negligible in many cases). Therefore it's smarter to apply your searching on lesser nos of blocks.
Have a look at the next video in the playlist to get a better idea, but most probably you would have seen that by now.

[@AmanMishra07]

Bhai tu to sach me tod samjhaya hai..tu hi Ravindrababu Ravula Sir ko takkar de skta hai

[@venkateshboyapally9669]

Sir IAM not finding b+ trees with example order 3
It is very urgent sir please help me

[@dailytalks123]

sir tuple calculus questions upload kijiye please

[@KNOWLEDGEGATE_kg]

will upload more topics soon..

[@karanjindal1860]

As we are using primary key, then why does sorting matters?

[@anamshahzadi8722]

For Binary search. If not sorted then still in hard disk it will find record sequentially/linearly.

[@suryakant8166]

sir, i am in urgent need of B Tree and B+ tree!@ please sir, help

[@theory6425]

did u get them?

[@sauravprasad1996]

what was that unusual sound @ 5:52 ? xD

[@Ankit-we8ym]

numericals kb krenge Sir

[@KNOWLEDGEGATE_kg]

just uploading ankit bhai....

[@akashmodak1904]

this is understandable easily but you are stretching the videos too long. This and the previous two videos are almost the same. There is nothing new in this one which wasn't in 5.4.

[@nikhiltejatangella5504]

Sir please tecah in english

[@KNOWLEDGEGATE_kg]

🔥Complete DBMS by Sanchit Sir: tiny.cc/DBMS_Sanchitsir_kg
🔥🔥All Computer Science Subjects by Sanchit Sir: tiny.cc/CSbundle_dbms_kg

[@dinshap.k8406]

Please explain in english

[@SaurabhWankhadesdrn]

Hi Sanchit, I think you have got Primary Indexing a bit wrong see th-cam.com/video/J5IewYFlhiE/w-d-xo.html Primary Indexing is not necessarily on primary key

[@rajarishabh5987]

i was here

[@rafidhaque8791]

hello dosto

[@sharathkumar3833]

Too long and not point to point explanation

[@anupambhattarai8765]

You are repeating same thing a lot of time. 😕

[@NishaSharma-nd1dk]

Thanks sir g

[@KamleshKumar-nw5ii]

good Explained ..thanku so much sir..