4:22. So 2^9 indexes (2^3 byte per index) on a block of 2^12 byte. How about the bytes required for child pointers?

1:20 wouldn't the hash function be x mod 4 then? (since its taking the 2 LSBs i.e. modulo on 2^2) 4:20 now it becomes x mod 8 (2^3, 3 LSBs)

When someone really knows, even baby can understand! Thanks 👌🙏

Douglas, thank you! I need this visual explanation with every step along the way explained!

where can i find the presentation?

zhinagou！

hkvhjvhjvhjvhjvjh!!!!!!!!!

kjgjkgjgkjgjk!!!!

khjk

There is no video that explain interactive deepning search in Japanese.　i envy english user.

Thank you very much! Can someone explain to me, at the point when "19" is copied up for the first time and the root is full after and with the root split "19" moves up again, why is there no remaining copy on that second level of "19" in the right split? (as shown in 4:50)

it's 2024 and this video is still helpful!

You have saved me from trying to imagine the meaning that my prof's garbled teaching about this intended to convey. It's really not hard to understand when *you* explain it.

it took me more time to find your video among all the not-understandable ones than to to understand once I found it. Thanks.

Amazing. Still helping people in 2023

This is sooo helpful. Thank you so much!!!!

This video is pretty old but it helped me a lot, thank you!

i love you

Thanks Douglas Fisher <3

Thank you for this, this was the best video I've seen for insertion in a b+ tree online!

expalnation on what is a local depth is little confusing.

Thanks for the great video!!

Thank you, it is really helpful for my AI exams

Learning from 2022! 😲😲

AMAZING EXPLANATION

Awesome stuff!! Helped generations of CS students!! May goddess saraswati bless you!

Is there a synonym for Frontier? that word just throws me off

Thanks man

You're a saint. I pray for a long healthy life for you

Great video - thanks for this!

Thank you sir!

I understand,thank you!

讲得挺好的就是一直叫我pause。。。。

Very helpful and clear. Not even 2 expert teachers from my Uni were capable to explain it better. Thank you!

Thankyou for this awesome explanation!!!

10X better than my school professor. Hats off!

thanks

wow amazing demo for insertion, would like demo for deletion too

that's excellent

Very well put, thank you.

Great video. The case of the very first insert (though trivial) should also be presented for completion though

you just made me realize how bad is my lecturer in explain things

يسلم من ربااااااك

if max key is odd , then how to divide ?

thank you very much sir!

I know that this video is very old, but I just wanted to leave a comment and say thank you so much! My teacher didn't really go over insertions very well, so I didn't understand why nodes would split in certain ways and why some keys would copy up while others moved. Your explanation for why that happens made it all click.

Fantastic video

osaba bin hashing approves this message

you are missing 13 in the leaves