Simplest, Most Detailed Explanation of BTrees | Why do Databases use BTrees not BSTs or Arrays?

[@koustubhshidlyale7545]

loved the way you implemented data structure in real-world application. This helps us to understand how different data structure works rather than just solving leetcode problems.

[@KingKing-jy4kk]

Hey i think it will be good to mention that in the time, mainly searching time of block in whole disk is considered. It looks like initially we are considering just block access/read time then later on we optimising search time. It can lead a confusion that all index tables ultimately pointing to 10^5 blocks only which also have to be read at the end, so its still 100 seconds to read via the index table as well.

[@initiator0016]

The depth with which things are explained really makes a difference. Keep up the great work.

[@KeertiPurswani]

Thank you so much! 😇

[@vinayakporwal9885]

Easy math for storing disk calculation: - Each pile of disks can store 10 records and takes 4KB of storage. - To store 1 million records, you need 100,000 piles. Traversing each pile takes 1ms, so total time is 100 seconds (100,000ms). Optimizing with Index Table: - Each index table row takes 10 bytes to store one pile's address. - 1 pile (4KB) can store 400 rows (addresses). So, 1 index pile can store addresses for 4,000 records. Result: - To store 1 million records, you need 250 index piles additionally to make it optimize. Access time is now 250ms to 251ms (250ms to find the right index pile, 1ms to access the record). Further Optimization with another Index table: - We know each row takes 10 bytes to store one pile's address. - We have 250 piles of index table-1 that we are storing each pile in each row of Index table-2 which takes 250 rows (10 bytes each) = 2500 bytes < 4000bytes(one pile) Result: -- To store 250 index piles, you need one multi-index pile additionally to make it more optimize. - Access time is now 3ms = 1ms (for getting multi index pile) + 1ms(for getting index pile) + 1ms (for getting 10 records pile) correct me if some error

[@aishwaryas8283]

Thanks for this summarisation 👍🏼

[@DeepankarManduri123]

Hi Keerti, I am having 10 yr of experience in IT industry but the way you have given the internal overview of DB and given the DSA with practical approach, it has given me a revision of DSA and kudos to you, I am a big fan of your hard work and would like to understand DSA more from you . Thank you so much for such a mentorship

[@shlokbansod545]

guysss if you are wondering whether you should watch the whole video or not. Let me tell you this is the best video for understanding b-trees. I have watched every video on youtube but hands down this is the best video so far. You are the best teacher ever keerti mam

[@hpandeymail]

You are an exceptional teacher. Getting concepts driven in such a structured flow. 🙏

[@StellasAdi18]

This is amazing. Sometimes when you work in a company for 5+ years, at times tend to forget basics. Thanks for covering this topic and looking forward to more. You are one of the best teacher/mentor.

[@blogspotinfitec]

I really appreciate your hard work toward teaching in KZbin channel , SALUTE.

[@Hemanthkumar-ck1zu]

I have just found your KZbin channel. This is amazing. I mean this is pure gold!!, I don't know why KZbin didn't recommend you till now or why you don't have a million views.

[@KeertiPurswani]

I also don’t know why 🥲

[@Md_sadiq_Md]

The point mam showed me B-Tree I have just blown up Thank you for making me love with Engineering

[@VaibhavPatil-rx7pc]

clear, crisp explanation, top of top

[@DattaprasadChavan]

Excellent explanation. I fell in love with learning how DBs work behind the scenes. Thank you so much for such great content.

[@arvishdoshi6209]

Such a nice explanation of things and how it all works under the hood. I wonder why this channel hasn’t received a million subs yet ❤ .. surely deserves so much appreciation

[@Hemanthkumar-ck1zu]

I might get addicted to your explanations

[@Md_sadiq_Md]

A video on B+ Trees please 🥺

[@div0007]

Hey Keerti, I read about B-trees from the book Designing Data-Intensive Applications, but your clear explanation really helped me understand it better. Thanks for making this video!

[@raviyadav2552]

It is super intuitive. Thank you so much for sharing it :)

[@sagarsunar6501]

Really awesome content. Keep inspiring and aspiring! !

[@manideep7148]

u r the most underrated youtuber. you pace, ur way of explanation is amazing. btw I love the way u say "hey guys"😅

[@rohitsai806]

Hats off to your dedication 🎉..Great video about the internal working of indexing and really good comparison about the time taken using multiple data structures.

[@shortflicks83]

I love the way you are explaining each and everything. More power to you keerti from Pakistan

[@amitaggrawal5069]

Hello Keerti, Thanks for this amazing video. Your hard work is visible since you are going to such depths and helping to build the foundation on the topic. Looking forward for more such videos.

[@abhishekvishwakarma9045]

awesome content this series is going to be amazing 🔥

[@titanofchaos]

YOUR WAY OF TEACHING ❤

[@sragopal]

Thank you Ma'am this series will be a great hit for you :)

[@shru8178]

Amazing in-depth content! Thanks a lot :)

[@aumprakashdehury]

Hi Keerti, Please do separate video on B-Tree and B+-Tree.

[@yogeshsy7382]

A Big thank you! Can't wait for the next video on SQLite.

[@nakulmantri1235]

Beautiful explanation, loved the way you related indexing and rotated it to make btree

[@ankushladani496]

Thanks for this level of content...❤😊🎉

[@Praveshkumar-by3tq]

there should be a dry run of how the b-tree is formed, how it split and make one more level of indexing.

[@chargeduprochit2615]

it was an amazing video mam please continue this series ,its really helpful and intriguing

[@Mahmmadhusen072]

Exillent as usual 😊

[@TechSpot56]

Great explaination, keerti. repeating the concept briefly after in-depth explaination really helps. ☺

[@paramgoswami7224]

please do go into more detail .. maybe a seperate video about B+ tree

[@hemanthaugust7217]

fantastic video !!

[@PariRams]

I enjoyed the video!✨ I have a couple of questions though about indexing and how it works with different data types. 1.When indexing an integer primary key, I understand how the B-tree or B+ tree efficiently organizes and searches through numbers. But how does this process change when the index is a string? How are the addresses and values stored in this case? 2.Additionally, could you explain how a multilevel (composite) index works, especially with a B-tree? For example, if we index on two columns (say, a string and an integer), how does the B-tree structure handle this, and how does it affect search performance?"

[@KeertiPurswani]

Noted, let me cover in upcoming videos!

[@singhji4149]

Keerti courses are really awesome 🙌....

[@AmitKumar-xc2rk]

Great explanation, can't wait for the next video. Please drop it asap

[@abhidevlops]

Kirti mam great video need more videos like this 😍

[@x_x3557]

At 31:41, what range is pointed by each key? Does100 point to values =100, if yes then why are m-1 keys required ?

[@AnandTiwariJDE]

Amazing content. Experience can be more better with less Ad interruptions. Too many Ads interfere with learning!

[@blogspotinfitec]

Please provide more detailing

[@vaibhavyadav1787]

It would be great if you could tell how same thing work with SSD also. It's really appreciated what're you doing miss, hats off to you ;)

[@KeertiPurswani]

Will do! ✌🏻✌🏻

[@kapilyadav5101]

Great in-depth explanation

[@abushivivek4601]

Eagerly waiting for next one 💃

[@abhiram_ar]

love your teaching 🌻🌻

[@KD-mg1lv]

Excellent Ma'am👍🤌

[@wellwisher7333]

Thanks Keerthi.

[@binary-brackets]

Thank you @Keerti, Wonderful explanation!!

[@kaustavdas6550]

I understand that our height comes to 3 with a order of 100 or m = 100 and and n or total no.of nodes = 10^6. So if m is the no.of keys eache node should what is the physical representation of 100? Is it 100 records or 100 entries?

[@ronn004]

really awesome

[@sheruloves9190]

Wonderful!

[@chiraglosalka6893]

let's say HD has a total of 10^8 blocks, how does it know it has to go to only those 10^5 blocks? Wouldn't it search for entire set of blocks? Correct me if I am wrong.

[@vivekmishra5876]

Awesome 😮

[@gethighfly]

Hi Keerti, hope you are doing well. I have 2 questions: 1. Do your design courses really only require basic JS knowledge? Do you explain all the frameworks and libraries used when coding? How comfortable would one be following along? 2. Do you have any courses on distributed systems or do you intend on doing anything related to them?

[@KeertiPurswani]

Hey, Pre-requisites are always mentioned in the course description (check FAQ) LLD and HLD are interview prep focused courses vs HHLD focuses on project building which could be either for a better resume or to become better engineer. HHLD focuses on distributed systems. Please checkout curriculum and FAQ and if you have any further questions, mail us at [e-mail]

[@pranaykanjolia9077]

Heyy Keerti, u said 100 sec to ready 10^5 blocks in the first approach, in second by using index table, we are reading 250 block as entries addresses are over there, but those are also ultimately pointing to 10^5 blocks only which also have to be read at the end, so its still 100 seconds to ready via the index table as well. Kindly explain, what point u are trying to make over there?

[@riteshkumar433]

@@pranaykanjolia9077The second approach is when you are trying to find a row in the table by some value of a column that is indexed. In that case you will only need to iterate the whole index table at max and will be able to find that item. In the first case you will have to iterate the whole table.

[@riteshkumar433]

But in this case you could also optimize by using binary search on index table as we are already assuming the table is sorted.

[@adityavijaysomani2546]

Can you explain here in comment --- m key in layer one , which contains mapping of other tables like that key can have m + 1 Child. Each child can suppose have 100 values (0-100 , 100-200 and so on ). If this child consider as parent for his child ( it should technically have 100 keys ) and his child can have 101 children. I am not undestanding m keys parent can have m * m keys as total keys of child. ( time in video 33:40) . Maybe I am thinking something.Can you give little more clarity ?

[@jaygoyani5934]

thank you didi💞

[@TheBigOlTime]

please do create a indepth explaination on B+ trees also...🙂🙂

[@pishkekarsanthosh234]

level sabke niklenge after completed this playlist

[@srinathsagar4736]

Could you please share the resources you used in your research that could be useful to us?

[@debangshubanerjee1311]

every node(except root) should have minimum ceil(m/2) chldren and ceil(m/2)-1 keys. In the vdo it is mentioned wrong as min keys=ceil(m/2)

[@tripatjotsingh1623]

Great video and learning. Got a question that Mongodb's document has maximum size of 16 kb. Is it because of block size?

[@KeertiPurswani]

Thanks and nope. We will cover this!

[@akj3344]

Your proposal video sent me here lol. Love this content1

[@KeertiPurswani]

Hehe! Both great videos 🫢🫢

[@akj3344]

Indeed they are!

[@mithunrahman8978]

very nice mam, Plz make a video on B+ tree

[@mehdismaeili3743]

Excellent .

[@arshdeepkumar]

i hope i would have known the amazing concepts of databases in my college then would have focused more on OS and Networking Great Content is there any book i can read on OS ?

[@Ashutosh_ojha.]

Yes there is this famous book for the operating system just search: principles of operating system by galvin

[@singhji4149]

One more question that keerti will you covering sharding also ?

[@KeertiPurswani]

Ofcourse! That is such an important part of databases

[@prashantkumar2963]

Geth uses trie to store data.

[@accidentalSoftwareEngineer]

Why ram is fast and expensive

[@rabindrapatra7151]

I am working since 8 years, yet not reached to depth. Surely 40 minutes wont give me in-depth I feel.

[@KeertiPurswani]

If you always keep thinking like this, how will you ever reach the depth? It’s one step at a time. You have to get started somewhere and this is an entire series. I don’t get your reasoning 🤷🏻‍♀️

[@rabindrapatra7151]

@@KeertiPurswani I was looking for more longer and detailed content with some code using b trees, b+ trees

[@KeertiPurswani]

@rabindrapatra7151 we will be going through the code of actual databases and debugging it and this isn’t the last video 😇

[@manideep7148]

@@KeertiPurswaniu r the most underrated youtuber. you pace, ur way of explanation is amazing. btw I love the way u say "hey guys"😅

[@deadpoolx1477]

Madam your looking like Niharika Konidala

[@Bhairav-r4x]

That's fine but how to make my brain to work faster that is my first problem, can we implement indexing for same😂😂😢

[@a2zfun181]

Ye to mera gate ja syllabus h.. 😂😂😂sector, disk, flatter, read n write seek time...

[@amogu_07]

Letsgooo

[@KeertiPurswani]

✌🏻✌🏻

[@niteshshah4306]

Level sabke niklege was like:- 🤣🤣...

[@Praveen-i9o]

I hope you understand that much at least - that’s Arrogance

[@KeertiPurswani]

What’s arrogance? 👀 Teaching well?

[@DarkKnight-o8w]

Dell intel all are laying offs, market down and these bhaiyya didis saying market is good, course le lo job lag jayegi 😂

[@KeertiPurswani]

Tutorial video pe bhi hatred failaake funny aur cool lagna chaah rahe ho? Khud ki bejjati kr rhe beta

[@prashantkumar2963]

I am myself reading Go Ethereum.A client of ethereum.

[@selfmotivatedperon007]

More respect for such content contributer 🫴🫴