📝Fractal tree index

Fractal tree is a data structure similar to B-Tree, but each index node contains an additional buffer for “pending” operations (add/update/delete). This allows Fractal trees to perform asymptotically better for writes. (because you only need to modify one node, and not log b nodes)


Want to receive my 🖋 posts as I publish them?