Fractal tree index

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a fractal tree index is a <a href="/facts/Tree_data_structure/RcXz9noF">tree data structure</a> that keeps data sorted and allows searches and sequential access in the same time as a <a href="/facts/B-tree/IHE2l8GR">B-tree</a> but with insertions and deletions that are asymptotically faster than a B-tree. Like a B-tree, a fractal tree index is a generalization of a <a href="/facts/Binary_search_tree/gWubNt7b">binary search tree</a> in that a node can have more than two children. Furthermore, unlike a B-tree, a fractal tree index has buffers at each node, which allow insertions, deletions and other changes to be stored in intermediate locations. The goal of the buffers is to schedule disk writes so that each write performs a large amount of useful work, thereby avoiding the worst-case performance of B-trees, in which each disk write may change a small amount of data on disk. Like a B-tree, fractal tree indexes are optimized for systems that read and write large blocks of data. The fractal tree index has been commercialized in <a href="/facts/Database/VYcpkevb">databases</a> by <a href="/facts/Tokutek/xAbjCPKl">Tokutek</a>. Originally, it was implemented as a cache-oblivious lookahead array, but the current implementation is an extension of the Bε tree. The Bε is related to the Buffered Repository Tree. The Buffered Repository Tree has degree 2, whereas the Bε tree has degree Bε. The fractal tree index has also been used in a prototype <a href="/facts/Filesystem/FdPm90uc">filesystem</a>. An <a href="/facts/Open_source/7X9rCdz4">open source</a> implementation of the fractal tree index is available, which demonstrates the implementation details outlined below.

Fractal tree index open-in-new

Fractal tree index