5.8 Secondary Index in DBMS in HINDI

Подписаться 684 тыс.

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

50% 1

📝 Talk to Sanchit Sir: forms.gle/WCAFSzjWHsfH7nrh9
💻 KnowledgeGate Website: www.knowledgegate.in/gate
📲 KnowledgeGate Android App: tiny.cc/KG_Official_App
➡ Do not miss our Bestseller Courses:
🔴 GATE Guidance-2025: www.knowledgegate.in/learn/GA...
🟠 GATE Guidance Plus-2025: www.knowledgegate.in/learn/GA...
➡ Contact Us:
🟩 Whatsapp Chat: wa.me/918595120657
📞Call on: +91-8000121313
🟦 Telegram Updates: t.me/kg_gate
🟩 Whatsapp Updates: www.whatsapp.com/channel/0029...
📧 Email: contact@knowledgegate.in
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: • Complete Operating Sys...
▶ DBMS: • Complete DBMS Data Bas...
▶ Computer Network: • Complete CN Computer N...
▶ Digital Electronics: • Complete DE Digital El...
▶ Computer Architecture: • Complete COA Computer ...
▶ Data Structure: • Complete DS Data Struc...
▶ Algorithm: • Complete DAA Design an...
▶ Software Engineering: • Complete Software Engi...
▶ Theory of Computation: • Complete TOC Theory of...
▶ Compiler: • Complete CD Compiler D...
▶ Discrete Maths: • Complete DM Discrete M...
➡ Free Subject-Wise Complete PlayList: 👇
▶️ DBMS: tiny.cc/kg_yt_DBMS
▶️ Operating System: tiny.cc/kg_yt_OS
▶️ TOC|Automata: tiny.cc/kg_yt_toc
▶️ Computer Networks: tiny.cc/kg_yt_CN
▶️ Digital Electronics: tiny.cc/kg_yt_Digital
▶️ Compiler Design: tiny.cc/kg_yt_Compiler
▶️ Computer Architecture: tiny.cc/kg_yt_COA
▶️ Data Structure: tiny.cc/kg_yt_DataStructures
▶️ Algorithms: tiny.cc/kg_yt_Algorithm
▶️ Set, Relation, Function: tiny.cc/kg_yt_Discrete_Relations
▶️ Graph Theory: tiny.cc/kg_yt_graphtheory
▶️ Group Theory: tiny.cc/kg_yt_grouptheory
▶️ Proposition: tiny.cc/kg_yt_prepositions
#knowledgegate #GATE #sanchitjain
*********************************************************

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

3 май 2017

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

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

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

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

For complete DBMS, check out this video: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-YRnjGeQbsHQ.html

@kundan625 7 лет назад

2x me ghajab mast lagta h :D

@ServicetoProductBasedJourney 5 лет назад

0.25 X Me dhek

@shashankdixit92 5 лет назад

@@ServicetoProductBasedJourney Abe kuch Jada hi mast hai ye to😂😂😂

@ServicetoProductBasedJourney 5 лет назад

@@shashankdixit92 😂😂

@ShaliniSingh-xc5rn 4 года назад

Thnku

@ShaliniSingh-xc5rn 4 года назад

2X bst for revision

@AbhishekKumar-lb1gr 6 лет назад

very good sir this is the first time when I really know what is indexing..

@TanveerAhmad-dj5vt 6 лет назад

very efficient style of teaching .looking for more videos Thanks

@adeebaiitbbs 5 лет назад

Best explaination.Thanks a lot.Please upload video regarding B and B+ tree.

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

7:47 no doubt Sir itna achha padate hai because Sir genuine anand leke padate hai. 🙏

@mithunkrishna2135 7 лет назад

thank u sir,,it's really helpfull...

@divyanshisrivastava8247 6 лет назад

sir ur videos are effective ....plzz upload btree and b+tree video

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

Great explanation ever on indexing content. I honour your teaching sir. God bless you and your nearer.❤ Thank You 🙏🏻

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

You are very welcome Himanshu, glad you liked the content. Keep learning & following. You can also check out our website www.knowledgegate.in for more amazing content👍

@ashishsharma9688 6 лет назад

Sir upload the video of B and B+ tree

@divyadhone4557 7 лет назад

plz upload a b and b+ trees

@suryakant8166 7 лет назад

sir , in urgent need for B and B+ tree. please sir.

@ctrlplusinvest 6 лет назад

For a second, I thought you were asking for blood.

@nayaaccount5575 5 лет назад

haaaha @@ctrlplusinvest

@chhatrapalnayak3946 5 лет назад

Watch Abdul Bhari's Video

@attsopal 5 лет назад

@@chhatrapalnayak3946 Abdul Bari*

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

@@ctrlplusinvest hahahahahaha

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

kafi sahi explanation.

@MayanaHebaKhanam 5 лет назад

👌👌👌 Outstanding explanation

@bhaskarbisht984 6 лет назад

thanks sir great help to us

@YouTubeFreaker 7 лет назад

awesome work

@shivanibirajdar5906 7 лет назад

Superb explanation! Concept completely cleared!

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

Acha

@parthpercy3210 7 лет назад

thanks a lot for the video sir, hope to see b and b++ trees numericals soon

@KNOWLEDGEGATE_kg 7 лет назад

hi parth, thanks for your comments...yes will be uploading numerical soon...

@darkl1ght9 7 лет назад

Thank you very much, sir. The video was very helpful.

@KNOWLEDGEGATE_kg 7 лет назад

pleasure is entirely mine ayush...god bless you...

@user-pt3yg7wg3n 5 лет назад

Someone please give this man a nobel 😱😱 Super teacher

@mrunalinidudhagawali1945 5 лет назад

Sir plz give videos on Multilevel Indexing plz

@adityamohanty1258 7 лет назад

Great to see u back again sir

@KNOWLEDGEGATE_kg 7 лет назад

thanks a lot aditya....its always great too to see your comment...

@sonusah1681 6 лет назад

thanks sir

@vaibhavtandon7626 6 лет назад

sir please upload a lecture on multilevel indexing with numerical example :-)

@akidataharat4939 6 лет назад

pls upload a video on hashing. TIA

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

Sir please can u provide lectures on Hash Based Indexing and Tree Based Indexing and B+Trees

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

13:41 if you are making notes

@NishaSharma-nd1dk 3 года назад

Thanks sir g

@aadirishiinfotechsolution4506 6 лет назад

good study material

@ektasrivastava8651 5 лет назад

Sir please make a vedio on b-tree .

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

When you are including each record in the index file then why each entry in index file point the block address,why not point to their actual address,It will save one block

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

good question.... I have the same doubt.

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

Nice one

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

because block points to set of attributes related to that record

@rajendragurjar7442 6 лет назад

nice ...one ..

@ash57781 6 лет назад

sir if block has values 1,2,3 in main file and index file too has block having 1,2,3 so it will be redundant pointing to same block in main file

@ShaliniSingh-xc5rn 4 года назад

Thank u sir

@momscookbook2222 Год назад

Thanks for the information

@KNOWLEDGEGATE_kg Год назад

Most welcome dear❤Keep learning & supporting! Stay connected for more amazing videos & upcoming contents 👍😊

@monishamondal6353 5 лет назад

I don't understand one point sir.. why logn+1 here? because there are block pointers for all the SKs. so after searching , it will directly reach to the required SK value !. 😞 please answer sir.. i followed every videos made by you. and its sooooo helpful 😌

@shaan200384 6 лет назад

Sir,please upload B-TREE and B+ TREE

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

really commendable job.

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

Thanks a lot dear student.. Keep learning and supporting !! Do visit our website www.knowledgegate.in for more courses and contents !!

@narendraparmar1631 6 лет назад

thanks sir for excellent explanation 😃

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

Acha

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

Yes sir please upload B and B+ tree

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

U are amazing!!

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

Thank you.. Keep learning and supporting !!

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

I think there is no benefit of secondary indexing, consider a worst case in which we have database of only unsorted files, then for fast accessing, we will make index for each file which is dense indexed.

@NitinGagan00 6 лет назад

Sir, please upload video on b tree and b+ tree

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

okay

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

Very nicely explained 😊

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

Thanks a lot 😊keep learning! Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍

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

would've been universal if it were in English

@light-heartedpleasure6637 6 лет назад

Sir i have a question . You said that sparse indexing isnt possible with secondary indexing.! The main file isnt sorted for sure but it can have repeated value.! So while making its index we are only taking single values not the repeated one.! Thus some of the values woudnt be taken in indexing because we dont take repeate value. So there will be sparce indexing in sec. Indexing because we arent taking all the values.! Sir please try to answer this question

@crazyprogrammer2795 6 лет назад

Light-hearted pleasure i think if the search attribute(non key) is repeated inside a block then there is no need but if multiple copies are present in different blocks then we can modify the block pointer to hold all the base addresses for example if 1 is repeated in b1 b3 and b5 we make 1 a single entry in the indexing table and set the block pointer to hold b1 b3 nd b5

@nisargsheth9841 6 лет назад

but we can use sparse indexing only when the main file is sorted which is not the case with secondary indexing.

@shashankb8749 6 лет назад

Hats off.... 😎

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

Acha

@realbaniya 5 лет назад

Will the amount of time taken to construct dense index file differs from sparse index file, is there any way we can quantify the difference ??

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

Actually instead of doing binary search why not do a direct hashing if the keys are however going to be unique?

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

गजब सर जी ❤🇮🇳

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

Thank you😀 keep learning! Do like, subscribe & share the video, you can also visit our website www.knowledgegate.in for more amazing videos & contents👍

@vivekmodi3165 5 лет назад

sir, pls upload multi-level index and b, b+ tree Urgently pls sir

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

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-zeKNL3-AN_A.html but here numericals are there

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

If the main file is not even sorted then also secondary indexing applied because nonkey value or candidate key may be unsorted in the data file. Second thing is that secondary indexing applied with the primary or clustering indexing also.

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

Sir according to you Primary indexing is already done in secondary indexing, so while doing secondary indexing how we can take primary key as a search key because in table there is only one primary key and we had given primary key already for Primary indexing?

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

Then how secondary indexing allows both key for anchor attribute?

@dhananjaysingh3245 6 лет назад

Sir aapne serializabity puri video upload nhi kia

@mklsachdeva 7 лет назад

Sir shouldn't it be ( log n + 2) ? Because after searching particular block in index file in log n , we need to search for key in that block in index file and from there get the particular block pointer and search desired block in main file. Correct me if I'm wrong

@rohan30497 Год назад

considering there are duplicate entries and each block pointer in the index file points to a structure of bps which in turn points to block in the main file.. then I guess yes

@LuckyPatnaik 6 лет назад

What if there are unsorted repeated values in main file

@utkarshgupta2909 5 лет назад

Already told by sir.. index file will store a set of addresses corresponding to key value..

@chaitalikundu512 7 лет назад

sir,plz upload a vedio on multilevel indexing

@KNOWLEDGEGATE_kg 7 лет назад

Hi ChaitaliVery soon we will upload them.

@dhanachandraningthoujam6263 6 лет назад

Sir, it has been 4 months still I could find the lecture on Multilevel indexing/b-tree/b+ tree. Please upload the lecture as soon as possible. And also request you to give the lecture in English too.

@jerryboby2684 5 лет назад

liked the dictionary joke 9:06

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

Why not sort the main file itself !! I know the search attribute may not always be the same but even if we create a index file we'll have to use only one key attribute in any case

@KNOWLEDGEGATE_kg 8 месяцев назад

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