Thank you for this amazing video Ma‘am! Really helped me understand this concept for my DBMS exam! You are truly a gifted teacher, never stop sharing your knowledge with us! Greeting from Switzerland
The college that i pay, can't teach me, even though i try a lot to learn. Actually, they don't want to word at all, after getting salaries. And some newbies come up on board, and mess up things and end up making the board dirty, and giving tons of confusions. Ur quality is that ma'am, u don't mess up things, go simply with the rules, don't do aennnn aaannnn etc kind of drama, and deliver every dimension of problem related to the topic. Really v good. Having actual knowledge from free source, and having no knowledge from paid source. KALYUG 😕🙁😑
RIghtly said, Paying so much amount in the college but learning nothing. But here We get our concepts cleared with very efficient and simple explanations
Nice work here.. my concept id clear.. after a study of 2 hour in the end i watch this lecture i was so tired.. but then in the end your smile fix it all i paused the video and watched your smiling face for 1-2 minutes.. 😅 also i screenshot it.. 😋.. i also made my friends see ur smile... It's just made my day.. keep smiling.. and thank you for the video.. it's really helpful.. 😊
First of all thank you for your great explanation of these B*tree concepts. I want to clarify one thing is that in 3:30, you told that left child can be less than or equal to parent of it. But conceptually it can't be right as you told in the rest of the video. The right child can be equal and greater than its parent, left child must be strictly less than its parent.
brother that is another of way of implementing it, if you are doing that you have to do that consistently from the root to the leaf nodes, in the example she mentioned its the opposite. so this is not an example to disprove but rather this is an example where right child >= node value. just whatever you are following follow it consistently thats all.
Thanks alot mam for providing lecture on b tree and b+ tree deletion .Deletion in both is quite tricky and you explained it very well....mam It was hard and difficult to find deletion in both the cases.... Thank you very much mam....keep uploading videos.....
Thank you so much ma'am .You are so clear with your content and you are not concerned with like comment share and subscribe. This makes you unique too.
First of all these videos were very helpful. Thank you for creating videos and sharing the knowledge. I am trying to design something like my own data base. I wanted to know how to serialize and persist these B+ trees and store them in files. It will be very helpful if you can create another video regarding the same. Thank you :)
@@meishimanshu I was able to create it. I created a database from scratch by adding a file layer beneath the B-Tree. This allowed for serializing the nodes and loading them into the cache as and when access was requested. The serialization was done in the protobuf format. Unfortunately, all the code I wrote was propriety and was for my ex-employer. I no longer have access to it. I created a distributed database on top of Azure Cloud using custom B-Tree and node format. It was done to avoid costly database solutions on the cloud, as we didn't need very active indexing or reads on the database. Since we needed to persist it long enough in an incrementally backed-up format, we decided to create our own mini-database (which is good for faster writes but can still support log (n) reads occasionally). The journey from this video to the final database took me 6 months to work on scale. I could do 1 million reads in 40 mins and 1 million writes in 10 minutes on Azure Blob-based storage.
Thank you very much for the video One suggestion: the values on the top right is for 4, and the video is using 3, this sometimes creates confusion. :))
I have confusion: 8:19 borrowed 4 from immediate left node, borrowed node became parent , parent should be go down ,right? how 4 went there(below parent)?
@10:52 it wasn't deleted , it was just removed from the internal node following the rule....btw thank u so much for these amazing lectures...and like all...i will also appreciate your beauty...
m is number of children of a node and n is number of keys in the block that is in one node. Since n = m - 1 and m in this case is 4, n = 3 so ceil((3-1)/2) = ceil(2/2) = 1
Mam in b+ tree. In the internal node it is also contain data how we called this is a index because the value are same as leaf node and internal node???
Hi Jenny, you are a great instructure. Thank you so much everythings that you do for us. But i have a question for you. you sad that in left of side smaller or equal must be, and in rigth of side strictly must be greater, am i rigth. But when you remove 20, you add 28 left of side. must it be 25 here instaed of 28. ?
What is condition for root node and children node like in root node left child can have less than equal to and for children node the left node must have only less than values is it like that?
That was a wonderful revision of b+ tree concepts. Though i need to implement all this with some tweakings as an assignment. So can u give an idea how to implement all this in C.
Thank you for this amazing video Ma‘am! Really helped me understand this concept for my DBMS exam! You are truly a gifted teacher, never stop sharing your knowledge with us! Greeting from Switzerland
12:13
The college that i pay, can't teach me, even though i try a lot to learn. Actually, they don't want to word at all, after getting salaries. And some newbies come up on board, and mess up things and end up making the board dirty, and giving tons of confusions.
Ur quality is that ma'am, u don't mess up things, go simply with the rules, don't do aennnn aaannnn etc kind of drama, and deliver every dimension of problem related to the topic. Really v good.
Having actual knowledge from free source, and having no knowledge from paid source. KALYUG 😕🙁😑
Ur line is really very effective and true also......
That's so true 👍
yeah
RIghtly said, Paying so much amount in the college but learning nothing. But here We get our concepts cleared with very efficient and simple explanations
Awesome 💞
"deletion is complicated than insertion"
against nature rule🌹
this cleared all my confusions....big thumbs up ...the best video on youtube
Thanks alot mam
Thank you! I passed my exam thanks to you!
Thanks @norbetkolozsi
Thank you ma'am for this amazing understandable lecture...Best CS Teacher available right now on TH-cam😁🙏🏻
Thanks a lot, Mam.Best series of B tree and B+trees on TH-cam.Subscibed.
Nice work here.. my concept id clear.. after a study of 2 hour in the end i watch this lecture i was so tired.. but then in the end your smile fix it all i paused the video and watched your smiling face for 1-2 minutes.. 😅 also i screenshot it.. 😋.. i also made my friends see ur smile... It's just made my day.. keep smiling.. and thank you for the video.. it's really helpful.. 😊
I appreciate the fact that you guys gave me this recognition. Thanks.
🤣🤣🤣
Great video, she explained each and every edge cases.
Thank you for expkaining all cases thoroughly 👍👌
Loved the tutorial. Very nicely and easily explained all cases.
Thanks.
Genuinely best explanation I’ve seen! Thank you so much for helping with exam ❤
I can never learn this in a million years
Best among all !! 🙌💯
I am grateful for the kind words and encouragement
Thank You very much, Ma'am. This video helped me understand B plus tree Deleting Operation crystal clearly. You explain it as a piece of cake❤❤
Lovely tutorial😍
Thanks!
First of all thank you for your great explanation of these B*tree concepts. I want to clarify one thing is that in 3:30, you told that left child can be less than or equal to parent of it. But conceptually it can't be right as you told in the rest of the video. The right child can be equal and greater than its parent, left child must be strictly less than its parent.
brother that is another of way of implementing it, if you are doing that you have to do that consistently from the root to the leaf nodes, in the example she mentioned its the opposite. so this is not an example to disprove but rather this is an example where right child >= node value. just whatever you are following follow it consistently thats all.
Thanks alot mam for providing lecture on b tree and b+ tree deletion .Deletion in both is quite tricky and you explained it very well....mam It was hard and difficult to find deletion in both the cases.... Thank you very much mam....keep uploading videos.....
i could understand more clearly in ur videos.....ur one of the best teachers....lots of love mam....
my goddess, you saved my life
Thank u mam,u r beauty with brain💞💞💞u r just 💕💕💕
So amazing tutorial!
U r making futures👍
the reaction of your eye put me in think that im in front you and watching live . i love your video and simple talks
Thank you so much ma'am .You are so clear with your content and you are not concerned with like comment share and subscribe. This makes you unique too.
Super teaching. Thanks a Ton madam
First of all these videos were very helpful. Thank you for creating videos and sharing the knowledge. I am trying to design something like my own data base. I wanted to know how to serialize and persist these B+ trees and store them in files. It will be very helpful if you can create another video regarding the same. Thank you :)
Had you created your database?
@@meishimanshu I was able to create it. I created a database from scratch by adding a file layer beneath the B-Tree. This allowed for serializing the nodes and loading them into the cache as and when access was requested. The serialization was done in the protobuf format. Unfortunately, all the code I wrote was propriety and was for my ex-employer. I no longer have access to it. I created a distributed database on top of Azure Cloud using custom B-Tree and node format. It was done to avoid costly database solutions on the cloud, as we didn't need very active indexing or reads on the database. Since we needed to persist it long enough in an incrementally backed-up format, we decided to create our own mini-database (which is good for faster writes but can still support log (n) reads occasionally). The journey from this video to the final database took me 6 months to work on scale. I could do 1 million reads in 40 mins and 1 million writes in 10 minutes on Azure Blob-based storage.
@@amitotc baap re kya kya tune bc
Good explanation and good design of examples.
It could not be taught better than this. Awesome. THANK YOU SO MUCH.
Great explanation thank youuu Madam! 🙏
karaboğa esenlikler diler
Jenny didi aap boht acha padha rhi hoo🥺🥺 . Mere or mere doston ki taraf se boht saara pyaar❤️❤️
Thank you very much for the video
One suggestion: the values on the top right is for 4, and the video is using 3, this sometimes creates confusion. :))
I think means 4 pointers and 3 keys
Clear and precise, to the point explanation.. And mam you are cute
very good exaplanation thanku for teaching me I understand what you said nice explanation
Best explained 🤜❤️🤛
Thanks for this concept.😊
This topic has been explained in much more detail,than one of the best available paid lecture for gate(sorry cant name it).
Unaacademy?
u r doing so much hardwork mam keep it up mam
Great video. Thank you so much you helped me for the mid term exam.
Thank you so much sister
plz do class on B star tree
THANKS A LOT MA'AM VERY VERY MOST IMPORTANT CONTENT PROVIDED BY YOU .
1... PLEASE MAKE A VIDEO ON KANADE ALGORITHMS .
THANK YOU AGAIN
Thank you dear mam 😊 & lv u 😄😍😍
Love you so much ❤
when deleting 25 why we did not ask key from its left sibling 17|19?
immediate se hii sirf borrow krega , if not then merging
Because 25 parent is 28 it can only ask to its sibling . It cannot borrow from others sibling as u said
Thank you but if it is better to put your videos last year 2-2 it helps me a lot .but now also it helped me
It's very useful mam 😇
If the rules are written at the side or so, it would be easy to revise
Great vid!!
thank you for this video!!
Quality is crazy high
Thank you
Thank you maaa.. i loved this video.. also you.. because of i got 10/10 in viva... T_T :*
I Thank you 3000 times
Explained so well! Thanks a lot!
great video, very easily explained each cases
I have confusion:
8:19 borrowed 4 from immediate left node, borrowed node became parent , parent should be go down ,right? how 4 went there(below parent)?
u r amazing thanks for yr vid really helped
Thank you very much! Very helpful
You are my lifesaver. When I get my degree, I will cross out the university name and put yours XD
statement at 15:35 is most important in B+Tree
Tnx a lot man..... Please try to upload a series on dbms
Superb class
Love you Mamm, Thanks alot
Rise ur hands who are watching this video before the examination 😂
The formula for minimum keys should be = ceil[(4-1)/2]==2 , The leaf nodes should always be more than half full right ?
best among all;;;;;;;;;;
One doubt. At 2:30 timestamp, why didn't you merge left and right subtrees to get 25,28,42 in one node?
Because the minimum number of children possible are 1, and that condition is satisfied. Hence we don't need to merge it
Thank You Jenny!
I want to learn this lecture till deleted keys = 25.because by here i can remember the condition for deleting a keys.
Maam kind request for a correction, the order of this tree is m=3. Please make that correction. Thank you for the valuable explanation !
Thanks a lot mam can you make a videos on oops full lecture pleeeeee....
Perfect explanation!
Thank you soo much Mam
@10:52 it wasn't deleted , it was just removed from the internal node following the rule....btw thank u so much for these amazing lectures...and like all...i will also appreciate your beauty...
😂😂
yes, finally found someone who is agree on this point.
superb jennie
thanks akka pls do video on b+ trees
love from ap
Excellent
Thank you so much
ma'am, it should have min. 2 keys in the leaf node.
ceil( (n-1)/2 ).. according to H.F. KORTH (book)..Page no:-635..line no:- 08
It's ceil (n/2) - 1
m is number of children of a node and n is number of keys in the block that is in one node. Since n = m - 1 and m in this case is 4, n = 3
so ceil((3-1)/2) = ceil(2/2) = 1
ratio
I am always waiting for the last "bubye and take care" :)
At 16:00, root should be (17) and leaves should be (1),(17,19,28)
Mam in b+ tree. In the internal node it is also contain data how we called this is a index because the value are same as leaf node and internal node???
very good
thank you so much!
thank you ma'am
Hi Jenny, you are a great instructure. Thank you so much everythings that you do for us. But i have a question for you. you sad that in left of side smaller or equal must be, and in rigth of side strictly must be greater, am i rigth. But when you remove 20, you add 28 left of side. must it be 25 here instaed of 28. ?
bhai parent agr 20 hai toh left side must be smaller then 20 and it also cannot equal to 20 nd right side must be greater than the parent node
u helped ty a lot
thanx mam a lot
What is condition for root node and children node like in root node left child can have less than equal to and for children node the left node must have only less than values is it like that?
That was a wonderful revision of b+ tree concepts. Though i need to implement all this with some tweakings as an assignment. So can u give an idea how to implement all this in C.
Bro have you implemented b tree using c??
@@harinath_mishra yes i have done it now
ma'am algorithm insertion and deletion b_ tree ka video bna dijiye
What do you mean internal nodes only store index? Doesn't internal nodes store key value? Otherwise how do you know which path to go down?
Hello Madam...when ever u r deletion 42 ...siblings max values is 19 but you are using 17...pleace clasrify that
Yes I too have same doubt
We are looking for the siblings of intermediate index . Not for the leaf node.
Mam, in the last step. . Why 1 is not included in keys if root node after merging
Thank You !! :)
Thanks alot
mam...i have a doubt...do we have to keep a node empty to point to the other leaf node...or else its just the linking
Wild perfect
Oh god insertion is so much simpler