홈 > 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.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
