B*-tree
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes
Facts
5 properties- Instance of
- data structure
- Studied by
- algorithmics[5]
🏷️ Also known as
en B* tree
en B*-tree
cs B* strom
de B*-Baum
es árbol-B*
es arbol B*
es arbol-B*
es árbol B*
fi B*-puu
fr arbre B*
it albero B*
it B*-tree
ja B*木
pt Árvore B*
ru B*-дерево
zh B*-樹
🔖 Identifiers · 2
- Dictionary of Algorithms and Data Structures ID
- bstartree
- Google Knowledge Graph ID
- /g/1hl3gqx9h
🔗 Connections
Based on 1
Different from 1
Instance of 1
Studied by 1
Subclass of 1
← Different from 1
Press Enter · cited answer in seconds