The Mutability Art of B Plus Trees

When b trees were implemented, or conceived, so to say, we didn't have s d. So we had like, spinning disk. On a spinning disk, you have an advantage of being able to finding a physical point on the disk and actually overwriting it. When whenever we 're writing to z, we can write a single page, but we cannot simply overwrite this page. We have to eraise an entire block. This is this process called garbage collection. And during garbage collection, you oll the block, relocate everything that is relevant and erase it after that. But if you're cycling through a bunch of pages, meaning that you keep, in order to make a