Search results
We did not find results for: Dancing tree.
Check spelling or type a new query.
We did not find results for: Dancing tree.
Check spelling or type a new query.
Tree data structure similar to B+ trees
In computer science, a dancing tree is a tree data structure similar to B+ trees. It was invented by Hans Reiser, for use by the Reiser4 file system. As opposed to self-balancing binary search trees that attempt to keep their nodes balanced at all times, dancing trees only balance their nodes when flushing data to a disk (either because of memory constraints or because a transaction has completed)... Wikipedia