The subtleties of proper B+Tree implementation

added by DotNetKicks
9/14/2022 4:13:24 PM

178 Views

I mentioned earlier that B+Trees are a gnarly beast to implement properly. On the face of it, this is a really strange statement, because they are a pretty simple data structure. What is so complex about the implementation? You have a fixed size page, you add to it until it is full, then you split the page, and you are done.


0 comments