Fractal tree index
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
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Fractal tree index
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
has abstract
In computer science, a fractal ...... tation details outlined below.
@en
Wikipage page ID
41,058,483
page length (characters) of wiki page
Wikipage revision ID
1,000,081,244
Link from a Wikipage to another Wikipage
invented by
Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul
@en
invented year
name
Fractal tree index
@en
type
tree
@en
wikiPageUsesTemplate
hypernym
type
comment
In computer science, a fractal ...... . Like a B-tree, fractal tree
@en
label
Fractal tree index
@en