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
Press Enter · cited answer in seconds
0 sources
B*-tree
Summary
B-tree is a data structure[1]. B-tree has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- B*-tree's instance of is recorded as data structure[3].
- B*-tree's based on is recorded as B-tree[4].
- B*-tree's subclass of is recorded as B-tree[5].
- B*-tree's different from is recorded as B+ tree[6].
- B*-tree's studied by is recorded as algorithmics[7].
- B*-tree's Google Knowledge Graph ID is recorded as /g/1hl3gqx9h[8].
- B*-tree's Dictionary of Algorithms and Data Structures ID is recorded as bstartree[9].
Why It Matters
B-tree has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[2] B-tree is known by 5 alternative names across languages and contexts.[10]