Can anyone suggest a reliable source(preferably online) for B+ trees explaining the operations and the algorithm clearly? Googled for a while, couldnt come up with anything good
Can anyone suggest a reliable source(preferably online) for B+ trees explaining the operations and the algorithm clearly? Googled for a while, couldnt come up with anything good
In the middle of difficulty, lies opportunity
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I could only find this : http://www.nist.gov/dads/HTML/bplustree.html. Am I missing something here.?
In the middle of difficulty, lies opportunity
Yes, click on the links which describe b-trees in general, which b+trees are a variation of.
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
I still have a little difficulty in understanding that case where a node is filled upto the limit and I still try to insert a number into it.
THis is what I have thought of , feeling too tired to actually code it now, please let me know if I am wrong:
1. insert the new value into the node as though it is still a valid operation.
2. split this node at the middle, push the middle value to the parent node and repeat step1 for the parent node
3. re-arrange the fragments of the split node to obey the rules of the B+tree.
repeat until I find a node that can accomodate the number that I have passed up or till I hit the root.
If I hit the root, perform 1,2,3 on the root , set the root to point to the "new root".
In the middle of difficulty, lies opportunity
