In computer science, a fractal tree index is a tree data structure that keeps data sorted and allows searches and sequential access in the same time as a B-tree 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 binary search tree 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 databases by Tokutek. Originally, it was implemented as a cache-oblivious lookahead array, but the current implementation is an extension of the Bε tree.

In fractal tree indexes, internal (non-leaf) nodes can have a variable number of child nodes within some pre-defined range.

When data is inserted or removed from a node, its number of child nodes changes. In order to maintain the pre-defined range, internal nodes may be joined or split.

Each internal node of a B-tree will contain a number of keys that is one less than its branching factor. The keys act as separation values which divide its subtrees.

Keys in subtrees are stored in search tree order, that is, all keys in a subtree are between the two bracketing values. In this regard, they are just like B-trees.

Text Source: Wikipwdia / Fractal tree index

[1]

[2]

[3]

Video Source :

1-Fractal/ Youtube/ O Baricentro da Mente

2-Fractal Tree 4K /Youtube/Woltvint

3-Python Fractal Tree /Youtube/ Rhino Grasshopper

4-Fractal Tree/ Youtube/ Rhino Grasshopper

5-Fractal Tree Animation / Youtube/ Fractal Tree Animation

6-How to draw Fractal Tree / Youtube / Dearing Wang

7-A Moving Fractal Tree/ Youtube /Akshit Sehgal

Image Source :

[1]
[Python Beginner][DIY] Make Fractal Trees/ Medium / Abhinav Mahapatra
https://medium.com/@abhinav.mahapatra10/python-beginner-diy-make-fractal-trees-b1a0903414a9

[2]
FRACTAL TREES – BASIC L-SYSTEM / generativelandscapes / Nick Senske / Youtube channel: Nick Senske

[3]
Recursive drawing / mit.edu
https://im.icerm.brown.edu/portfolio/perspectives-on-the-hilbert-curve/