Oh, I finally understand K after watching this a few times. K is 1/2 the # of key entries because when it's not the root it will be created by a split operation on a previous node. So it will always contain max keys div 2. So how do you determine k when you have variable length keys, like strings?
Then you keep k flexible or even better compress the pivot elements, e.g. for strings switch to some prefix (aka radix, aka suffix truncation)-style pivots in internal nodes. You can pick pivots however you want as long as they allow you to find the right subtree in a search-operation.
@4:00 "strictly smaller than 75 go left" - Are you sure about that? I just learned "smaller and equal: go left" and "strictly greater than: go right" or are there variations in determining the way through the B-tree? Thanks for your answer! btw: your videos are very helpful and clear. Since I can not attend any lesson at university (time issue) your videos really make my life easier!
Thank you, that's very beautifully explained professor. Don't stop being that awesome!
Wow, I'm amazed at how good these videos are structured! Thank you!
Really well laid out and explained. Thank you!
Oh, I finally understand K after watching this a few times. K is 1/2 the # of key entries because when it's not the root it will be created by a split operation on a previous node. So it will always contain max keys div 2. So how do you determine k when you have variable length keys, like strings?
Then you keep k flexible or even better compress the pivot elements, e.g. for strings switch to some prefix (aka radix, aka suffix truncation)-style pivots in internal nodes. You can pick pivots however you want as long as they allow you to find the right subtree in a search-operation.
Amazing video, excellent explanation!
thanks!
@4:00 "strictly smaller than 75 go left" - Are you sure about that? I just learned "smaller and equal: go left" and "strictly greater than: go right" or are there variations in determining the way through the B-tree? Thanks for your answer! btw: your videos are very helpful and clear. Since I can not attend any lesson at university (time issue) your videos really make my life easier!
How did we decide the node value , since it does not contain the value from column ?
Thanks for sharing, it was helpful.
thanks!
It was very helpful. Thanks ;)
Nice video, Thank You.
Awesome!
thanks!
Thank you!