Fractal tree index
id:
fractal-tree-index-264-5869886
title:
Fractal tree index
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Tree data structure
original url:
https://en.wikipedia.org/wiki/Fractal_tree_index
date created:
date modified:
2023-08-24T15:46:28Z
main entity:
{"identifier":"Q17014592","url":"https://www.wikidata.org/entity/Q17014592"}
image:
fields total:
13
integrity:
14