Lec-95: Numerical Example on I/O Cost in Indexing | Part 2 | DBMS

Подписаться 1,9 млн

Просмотров 249 тыс.

50% 1

►Part 1 of Numerical: • Lec-94: Numerical Exam...
👉Subscribe to our new channel: / @varunainashots
► Database Management System(Complete Playlist):
• DBMS (Database Managem...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on RU-vid: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com

Опубликовано:

25 окт 2018

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 191

@mridulayadav997 5 лет назад

No need of coaching classes your teaching style is superb ......thanku so much sir 🙏

@GateSmashers 5 лет назад

Thank You so much for the appreciation. Bless you. keep learning and sharing

@ayushibansal6635 3 года назад

did u clear gate??

@csgalaxy 3 года назад

ru-vid.com/show-UCS5cAoAFGB6-aUzbesg2svg

@learner5915 2 года назад

@@ayushibansal6635 yes 👍

@exclusivefacts8956 3 года назад

Today I cracked my viva due to your all lectures on dbms , really i thankful to you 🙆‍♀️ sir

@GateSmashers 3 года назад

Excellent

@ZainAli-ih1mn 10 месяцев назад

@@GateSmashersl think you did not write the correct answer for dense index because for dense there is only linear search available for non order it's ans I think will be 200 + 1

@sachthadani292 11 месяцев назад

Just amazing, how much effort this guy has put in, you have literally saved CSE engineers not going to lie sir...

@ladiharish7843 3 года назад

for sparse indexing when we find the block, then we again need to search 4 records with in that block soo the worst case for sorted records is will be (log50)+log(4)=7.64~8. Not 7 as mentioned. Also in dense case we can't apply log because the data is unsorted in dense.

@vasireddyganesh 3 года назад

Yeah I too got same doubt... How could we apply log in case of dense..

@prathanasaikia6837 3 года назад

Ya, for dense it won't be possible to use binary search

@abdullahalfahad3732 2 года назад

I think we don't need to search 4 times in sparse when coming to the data table in hardisk because data is ordered. A normal addition will help to find the data. but there's a problem in dense. let's assume the pointer table is ordered in dense but even then it doesn't make sense to add 1 because the main table's data isn't ordered so we'd need to add 4 instead of 1.

@anamshahzadi8722 9 месяцев назад

He said at start within block Indexing fast nai krti... Its all about I/O cost. Index table to Hard disk miss/hit ki bat hei... within block nai...

@mollamohammadibrahim5442 6 месяцев назад

Your are right. This is the answer of the doubt.@@anamshahzadi8722

@three856 3 года назад

Your analogy to real book made the concept clear ..sir..thank you

@GateSmashers 3 года назад

You are most welcome

@ankitaB11 3 года назад

The way you explain things, so far the best I've come across. Thank you for saving my time and I don't feel pressurised at all while learning rather it feels great!! Big shoutout to this channel!!

@ashleylove6840 2 года назад

same! I only know alittle hindi from watching indian movie, but when I learn from him, he is such a good teacher!

@vivekkumar-zk5ik 4 года назад

Sir u r really doing great job. Ur smile starting from video and after giving so much effort you end video with smile . It's really spread positive vibes.....Thank u for teaching us...

@GeerishaAcharya 5 лет назад

The way of explanation is Awesome...शुक्रिया सर..:) Waiting for another video..

@shubhangikumar6265 3 года назад

simply awesome !!!!! The way of explaining is superb, Thanks!

@eshaangupta4101 3 года назад

The Book analogy was an eye opener. Great explanation!

@avinashaspana179 5 лет назад

Sir, thank you so much for the video. It explains indexing clearly and very informative.

@syedabbas749 5 лет назад

Truly stupendous !!! Just completed all your 63 uploaded videos on DBMS. My DBMS fundamental have become more stronger. Thanks a lot Sir :) :) Just one request- As soon as you complete the DBMS course, kindly upload NET DBMS Solutions for past papers. Thanks again:)

@manojshirgire2549 2 года назад

simplicity in one word "superb"

@ashutoshbang8812 Год назад

Excellent Explanation... Hats Off to your efforts...

@syedanwar1872 Год назад

thanks for sharing your tremendous knowledge with us

@vaibhavirangari4569 3 года назад

This man deserve more view and more likes ... thank you so much sir for saving our future

@vickymore8752 5 лет назад

Sir you are doing best Please continue You will be the best You tuber in 2019

@bipinsingh888 3 года назад

I have a doubt about the case of Dense. In the case of Sparse, the data is ordered and there we can apply the binary search but in the case of unordered(Dence) the data in the Index table is also not sorted in such case we can't apply the binary search. I think in dense case it should be N ( which is 200 in the example case which is far less than 2500 earlier and far efficient). I might be wrong. Please correct me in case I'm wrong. Thanks

@tejasghone5118 2 года назад

Index table is sorted but the data isnt hence logn

@siddharthvs1770 2 года назад

@@tejasghone5118 But we are binarily searching for value.... Not the index....We don't need to search the index as its already in sorted order and can be reached in o(1) time just like array element.

@rahulshingne1963 2 года назад

The keys which are copy of PK or CK from the records in hard disk are sorted in index table, so we perform binary search on keys then the pointer associated with a perticular key get us to the exact record

@jatin1688 Год назад

Yaa exactly the same doubt he is wrong there

@aaravgavshinde1296 Год назад

For those who are having doubt and think in dense it should be 200 + 1: Keys in the index table are arranged in order to make it easier to search the records, so that we can use binary search. Hence lg(200) + 1

@ZainAli-ih1mn 10 месяцев назад

Yes you are right

@abhishekjain-tc3vy 8 месяцев назад

But If we see acc. to you, we have to make index table sorted which takes extra time. Apart from these If you google search you would know that Dense Indexing is Faster than Sparse. Google: Dense indices are faster in general, but sparse indices require less space and impose less maintenance for insertions and deletions. @gatesmashers Sir please make a pin comment every one is clear for this lecture

@ZainAli-ih1mn 8 месяцев назад

@@abhishekjain-tc3vy no you are wrong sparse is faster then dense index

@abhishekjain-tc3vy 8 месяцев назад

@@ZainAli-ih1mncheck in Google

@abhishekjain-tc3vy 8 месяцев назад

And also in indexing we have to short the index table that is to be add while calculating the time complexity

@biswamohandwari780 Год назад

He is a true genius. None can deny that

@aditinageshwar3217 Год назад

It's amazing sir.Your videos are always up to the mark and help me a lot .There is no other coaching classes required .All the doubts are always clear here .😀😃😃

@bubblebath2892 3 месяца назад

Man you are phenomenol ....such detail and accurate teaching .....rendered me speechless ...awesome bro

@emrulhasan1285 2 года назад

Sir, your videos are just awesome. Please keep it up.

@saurav2409 Год назад

Bhai ye underrated video hai, most important I can say

@oshniklife9661 5 лет назад

Sir coaching ki jarurat hi nahi hai....simply wooooooow

@ektabansal7645 10 месяцев назад

you do a great job, thanks a lot sir

@BiddyutHasan 5 лет назад

Beautiful teaching style...

@patilsp6518 4 года назад

DBMS my favourite subject because of You sir Thank you

@animationcrust1993 3 года назад

I have never ever ever ever ever...seen a techer like you...🙏☺️ Sir ji

@rituupadhayay5200 3 года назад

really very good explanation.. I saw both videos part1 and part 2

@KothaBangaaruLokamSydney 3 года назад

Excellent presentation...👏👏 you deserve more subscribers and views than what they are today...

@sujaa1000 Год назад

Thank you Sirji, very well explained, and understood, I have subscribed and have recommended to friends too.

@rishikeshsanjekar1349 3 года назад

Sir aapka bahut bahut shukriya mere DBMS pakka krne ke liye 🙏🔥

@prashanths4455 3 года назад

In dense indexing the records are un ordered then how can we use binary search

@AshishYadav-ey2vv 4 месяца назад

sir you are the best teacher for computer science

@abhinavg916 5 лет назад

Please make lectures on Theory of Computation and Formal Languages i.e AUTOMATA. We need teachers like you to teach us. We want to understand concepts, not for preparing exams. Thank you for Computer Networks Lectures, I learnt from those videos and feel confident in it.

@adishjain3309 Год назад

I would suggest video lectures from sipser, lol you prolly has been graduated by now

@khushbookabra1354 3 года назад

Best........Thanks a lot🙏

@ashutoshbang5836 3 года назад

Awesome videos. Thank you so much :)

@ashutoshbang8812 Год назад

Hello, Bang Saab

@mdaniquzzaman8120 7 месяцев назад

Masallah your explanations is excellent ❤❤❤

@sonalimondal2716 3 года назад

Ur teaching style is fantastic.....i loved it.....plz make videos on Ugc net unit 1 (discreet structure and optimization)

@utsavseth6573 Год назад

Brilliant lecture.

@manpreetkaur-lx9ci 5 лет назад

Thanks Sir.

@abdullahmoiz8151 5 лет назад

excellent explaination

@sandeepmundri7399 4 года назад

Thnx u paji bohat badiya

@waishanichowdhury6106 4 года назад

Sir,as you said dense is for unordered data so in that case time complexity should be of O(n) but why u did log200+1, according to concept it must be 200+1 due to linear search for unordered data.

@syedalmastirmizi3477 3 года назад

index table is sorted.. I don't think sir explicitly told this but binary search is only applied on sorted list

@eco89 3 года назад

@@syedalmastirmizi3477 Index table is not sorted. No where mentioned.

@RohitMishra-ox6oy 3 года назад

Index is always sorted ...watch once again he clearly said that if index is nit sorted then there will be no diff in searching with or without indexing

@RohitMishra-ox6oy 3 года назад

For confirmation

@LaxmiKumari-pc9rr 4 года назад

Thank you sir👍

@sratnamanjari244 4 года назад

Thank You So Much Sir

@MamtaSingh-vt4kg 5 лет назад

Thank you sir

@vaibhavsh07 3 года назад

Thank you!!!

@syedhabeebuddin1003 3 года назад

sir....thanks a lot !

@umarrashid3381 2 года назад

Excellent sir

@taj2991 3 года назад

Superbbbb 👍

@jaydubbewar2170 3 года назад

Thank you for the videos sirrr..

@himanshujain5670 4 года назад

nice explanation

@monikatadvi215 Год назад

Nice explanation sir

@hinabaloch6396 Год назад

superb

@shrutiart4127 5 лет назад

explanation mast h sir, Sir plz computer organisation k videos upload kardiye plz sir

@naimishmanzar5005 5 лет назад

please make videos on algorithms ur explanation is good

@viral_video_ayana 3 года назад

Thankyou sir

@prodiptamondal1758 3 года назад

For Dense shouldn't it be O(n) because of linear search? We can't apply binary search here.

@shadman346 2 года назад

i am bit confused... for dense will the unordered data be stored in ordered form in index pages?

@shubhamhaldankar9605 Год назад

Too good😍

@i.m.anonymous8492 4 года назад

Bhaiya just wanted to know, are entries in Index Table always sorted?

@himanshumamodiya1827 3 года назад

Good Lecture Sir :) Having one doubt here : without indexing, we are not considering searching inside a page, only I/O operation is considerable.=>fine with indexing => when unsorted => not considering searching inside a index page => log200 + 1 =>fine=> because here we have to find the right page pointer. with indexing => when sorted => we have to consider searching inside an index page also because that's the only thing which gives us right DB page => so here time will be log50(searching right page among 50 pages) + log50(searching right record among 50 records) +1 Please correct me, if I made any mistake here.

@thisistusharmahajan Год назад

Bhai Unordered ya dense vale case me sir ne binary search kaise laga di kuki data sorted nahi hai to binary search kaise laga rahe hai...... yahi doubt hai mera!

@goramnikitha5491 Год назад

same doubt

@shubhankarbhadra131 3 года назад

I think there is a mistake in the end part of the video when I/O cost is being said for dense entry. Since it is unordered, there will be no concept of binary search, so it should be 200 searches in index table and 1 search for the corresponding hit in the index table. === (200 +1). And the average answer will be 200/2 = 100.

@chiragjaiswal9387 2 года назад

Bro You really helped me at 4:42AM...I'm also thinking about but you assured me that i'm not alone and make me feel right....Thanks for Sharing

@jeevanaadhaar-mereprabhu Год назад

True same doubt I also got

@ffaheem Год назад

The key values will be inserted in sorted manner in the index table and they will be pointing to the corresponding block So, I believe we can do binary search in index table that will give us the block and then we can load the entire block in ram and then search for our key so it will be log2(200)+1

@nilanjanabose3059 Год назад

But after indexing we are searching in index file so it is sorted the main file was unsorted

@SachinPatel-ff2or Год назад

In dense we have made index table for all 10000 records not for 2500 blocks, So we can make it ordered and then can apply binary search. So sir is correct.

@sangdilbiswal30 Год назад

how come sir, we are using binary in case of Dense as it is unordered it will have normal liner search?

@ayushikatroliya1473 6 месяцев назад

Please add dense and sparse indexing also in title. This will help students who will come in future.

@world_of_programming9653 4 месяца назад

Sir, why we use log based time complexity in unordered list (Dense)

@amanvijayvargiya3468 3 года назад

tussi great ho paajiiiiiiii😁😁

@Lallu-gv9rs 3 месяца назад

Hello ! Can anyone tell me whether this playlist would be enough for doing a course which has hands on project ? Please tell me. Thank You.

@khushibhambri626 3 года назад

10:44 whty are we taking log(200) the data is unordered so avg time should be 200/2 = 100 or simply O(no. of index blocks) ?

@goramnikitha5491 Год назад

sir can u please explain why have u added extra plus 1 to search a record in a block in indexing search where as in last lecture video in binary search of n =2500 (here n is number of blocks ) we got log2^n =12 where u haven't added plus 1 but in this case also we do search for block and after getting that particular block we should search of particular record only .

@ManishKalyan-gx2wi Год назад

why log(200)+1 in case of dense searching as data is unordered in index table..it should be avg of 200+1, right?

@kshitizjain9557 3 года назад

yeh ek accha video hai

@aarjavjain3074 3 месяца назад

How can dense searching take log time when data is unordered? Isn't binary search applicable for ordered data only?

@abhishekjan9026 3 года назад

i think searching time in DENSE index should be O(200)+1 rather than log(200)+1 ?

@sayandey1478 4 года назад

Dense me log +1 kuyn, + 1 to nahi chahiye na? ptr per record to hain hi, phir hard disk me kuyn search kare?

@ajinkyarodge6230 3 года назад

Bhai dekh dense me bhi tuze starting Ko sirf required index value hi milegi , par tuze main value find out karne ki liye us index value pe to Jana hi hoga na , so udhar jane ki liye tuze Aur 1 bar search karna padega isliye + 1 Liya hai ..

@ashishsoni3187 3 года назад

DOUBT - log(50) gives the corrosponding block and not the index for next block we need log(50) * log(50) ( or log(2500) better )to get index from index table

@Anonymous-yk1eh 2 года назад

* In dense , why 1 is added * as in sparse it require further search in page but in dense it have all records.

@ranveeryadav3456 3 года назад

Hello sir, in 8:59 how can we get a block in log2(50), when each block of index itself contains 50 blocks of hard disk ( in case of spars ) rather we get bulk of 50 blocks and to get the required block we have to again binary search in that block of index therefore to get the required block we have to search again log2(50) after this we will get successfully our required block, therefore total time complexity of searching in index is log2(50) + log2(50) which is log2(2500), and after this time we will again search our required record in that particular block. Correct me if I'm wrong, and thank you sir for this amazing series.

@madhakayaswanth2987 6 месяцев назад

exactly same doubt

@shah12155 5 лет назад

Dear sir indexing in your 3 lectuers are 101% clear but plzzzzzzzzzz explain b tree and b+tree and as well as hashing topic......

@adityaanand5447 3 года назад

Sir, at 9:09 it should be [log50] + [log4] = 8, as there are 4 records(sorted) in each block.

@VikashKumar-ug5jx 3 года назад

he only considered the no. of blocks needs for searching.

@anandbhalerao6581 10 месяцев назад

can we store the index as a hashmap? then the searching would be constant and not logn.

@shubhojeetbanerjee6810 2 года назад

10:27 Why we are calculating the log2 (200) as we are using dense and records are unordered and cant use binary search.

@devenderk.2745 4 года назад

Sir, Thankyou for the best lecture videos, Your teaching skills are above the level, from that elementary class students can also understand the same. Sir but i hv 1 doubt: At Duration(in Video): 9:10 u said that we have to search 6 + 1 . But when we approached to M.memory then why are adding 1 search only for it, as within the blocks there are no. of records(In our case its 4). Please tell me ??

@deepaknegi7589 3 года назад

Same doubt

@adityaanand5447 3 года назад

it should be: [log50] + [log4] = 8

@anandverma2714 5 лет назад

Sparse indexing me pointer se sidhe required data block kaise access kar sakte hai like if i want to search for record no 4 Sir plz explain

@HarshFast 3 года назад

In dense indexing we can directly go the record why it will be log200 if data is unordered ?? Please verify last part of the video

@srijitanitamajumdar5904 4 года назад

Sir, in case of mapping in dense indexing, all the 10000 records that get mapped into all the 200 index table blocks would still be UNORDERED. Thus, traversing them would require a time complexity of O(n) rather than O(log n), as in the index table we would need linear search, don't you think? Please comment.

@GateSmashers 4 года назад

Index table is always ordered..it can not be unordered

@srijitanitamajumdar5904 4 года назад

@@GateSmashers Thank you, sir.

@swarnikarout3824 2 года назад

@@srijitanitamajumdar5904 I have same doubt also

@swarnikarout3824 2 года назад

@@GateSmashers ok sir..thank you sir 👍

@itsmytechnology9285 2 года назад

Thanks sir!!

@sajansekhu8785 4 года назад

sir pls a make on a vedio of past year ugc net exam..

@ananya8740 2 года назад

can anyone explain me that why we take the size of index block same as that of hard disk block ?? why not different ??

@nikhilagarwalassisi 3 года назад

log(200) cant be done in unordered it should be 200/2=100 for unordered i.e. dense

@kunalsingh5794 5 лет назад

Sir, please give the serial no means sequence no of all videos.....

@alaminice8538 3 года назад

Sir Plz take a class about RAID

@jatin1688 Год назад

I think there is some mistake in dense index table because you said we are scanning in each pages of page table after doing binary search but if we are not able to find the required page in that block then where we need to go because data is sored in unordered fasion.

@sangeeta6388 4 года назад

👌👌👌👌👌💕💕

@rahulshingne1963 2 года назад

Even in sparse we have to search in all 50 blocks then again for 50 entries

@dharmendersharma1092 3 года назад

Sir mein sirf apki videos follow kar Raha hai ye videos comptetive exams ke liye sufficient hai .

@tecnology7073 2 месяца назад

😍😍🥰

@shreyachakraborty9655 2 года назад

Sir I have a question you said when it's unordered we're using dense but when ordered we're using sparse but in both sparse and dense we're taking time complexity of logN which is used in the case of binary search but binary search can be used only for ordered then how can we use binary search in case of dense which is already unordered?

@rahulshingne1963 2 года назад

Keys are sorted in index table