Home >  Term: B*-tree
B*-tree

A B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes.

0 0

Penulis

  • GeorgeV
  •  (Gold) 1123 poin
  • 100% positive feedback
© 2024 CSOFT International, Ltd.