B*-tree (Q1936252)
Jump to navigation
Jump to search
B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes
- B* tree
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
|