Lec-97: Primary Index With Example | GATE, PSU and UGC NET | DBMS

preview_player
Показать описание

Primary Index is an ordered file whose records are of fixed length with two fields. The first field of the index replicates the primary key of the data file in an ordered manner, and the second field of the ordered file contains a pointer that points to the data-block where a record containing the key is available.

► 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:
Рекомендации по теме
Комментарии
Автор

All my CSE subjects at one place. Thank you Sir. Very clear explanation.

harihardurki
Автор

I'm Telugu but I'm understood ur explanation .superb bro

vijaykrishnaramagiri
Автор

This is brilliant.. The best part is, explaining the time complexity to showcase, how indexes would make things faster.. Awesome..

rajeshg
Автор

well done gentleman its great to watch and listen to the logical flow of these things, keep it up mate

muhammadabdullahfaheem
Автор

I have followed the indexing series. Very well explained and you have quality which will make viewers stick to the video till the end.

sumitbarde
Автор

Nice explanation as always...❤️
Almost completed playlist...easy explanation and nice efforts...keep it up sir..!!😀

kairavgamit
Автор

Fun fact : Sir I usually watch your videos in 1.25x speed so, when I watch your videos in 1x speed then I think I'm in a slow motion world. 😂🤭

sangramsahu
Автор

I feel that the search time should depend on number of blocks in hard disk and not number of blocks in Index table. This is because even if the index table is sorted, you will have to perform binary search on the Keys and not on the block address of index table and the number of keys is equal to the number of blocks in the disk.

So, log2N + 1, where N = Number of blocks in the disk.

On second thought, are you trying to say that while doing binary search, you will just check the starting Key of each index table block for comparison and not each and every key?

UMANGTAILANG
Автор

Sir u r best teacher..I want to join your class..i completed B.A. (Arts) in Marathi language.. I m learning IT syllabus.. I m interested in IT job..so can get job in IT field... It's my dream job.. I want to work on Application and production support engineer..so sir pls give me some suggestions 🙂

bhosalep
Автор

During this corona time i took admission in MCA and being from a non computer background i was too depressed because i couldn't understand anything during online classes

But now MCA have been interesting to me
All thanks to you sir

bhanusharma
Автор

Thank you so much sir aapne bahut hi achchhe se iss concept ko samjhaya WO bhi bahut hi kam samay me

amanprajapati
Автор

YOUR TEACHING IS MORE THAN EXCEPTIONAL 😍😍😍

kgfchapter
Автор

very good explanation sir . thanku soo much for ur vedios .

mukkerlaramya
Автор

THANKS SIR ALLAH PAK BLESS YOU AND YOUR FAMILY AMEEN

mr.gamertech
Автор

I have a confusion...in case of sparse index when we search the block of index table, don't we need to search the record in it to find the location of the block in hard disk provided that the index table contains a anchor key and not the actual key of record

mangleshsingh
Автор

mujhe aaj pata chala ki ekk name se kaii saari train hoti hai pahle sochta tha ki ek train hoti hogi

GATEWith_HARIS
Автор

He is like jeetu bhaiya for us ❣️❣️ whoever agrees like it 🎉🎉🎉

piyushsanduja
Автор

Primary index is a sparse index, complexity is log2n+1

zzzz-novd
Автор

Thanku sir DBMS and sql all cleared sir

naamkaengineerhoon
Автор

Hi Gate Smashers,
I was reading the book DBMS by korth, at page number 625, 14.2, it is written that primary index and clustered index are same

prashantgupta