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

► Database Management System(Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Computer Architecture (Complete Playlist):
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Operating System:
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[ankitaB]

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!!

[ladiharish]

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.

[aditinageshwar]

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 .😀😃😃

[AshishYadav-eyvv]

sir you are the best teacher for computer science

[world_of_programming]

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

[rahulshingne]

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

[sajansekhu]

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

[shadman]

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

[adarshagrawal]

index table operating system ka page table jesa hua

[mridulayadav]

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

[bipinsingh]

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

[exclusivefacts]

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

[waishanichowdhury]

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.

[MastiManiaTV]

dense main +1 nahi aye ga aor log 2 200 nahi aye ga keun k data sorted nahi he. baki you did well. keep doing

[shubhankarbhadra]

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.

[ranveeryadav]

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.

[Johnny_sinswa]

Non ordered me toh linear search lgega na toh usme log200 kaise hoga log toh binary search ke case me aata tha toh 200 aana chahiye worst case me 🤔🤔

[aaravgavshinde]

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

[prashanths]

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

[nikhilagarwalassisi]

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