No. A node in a B*Tree can have many keys (which point to many children). They operate by comparing keys in order to select a child node, much like a binary tree. But, the intent is that each node is stored on disk, and can be read into memory at once. Thus, the number of disk accesses required would match the depth of the tree.
发布评论
评论（2）
不。请注意，* 表示节点至少已满 2/3。
Nope. Note that the * indicates the nodes are at least 2/3 full.
不可以。B*Tree 中的一个节点可以有多个键（指向多个子节点）。它们通过比较键来选择子节点，就像二叉树一样。但是，其目的是每个节点都存储在磁盘上，并且可以立即读入内存。因此，所需的磁盘访问次数将与树的深度相匹配。
No. A node in a B*Tree can have many keys (which point to many children). They operate by comparing keys in order to select a child node, much like a binary tree. But, the intent is that each node is stored on disk, and can be read into memory at once. Thus, the number of disk accesses required would match the depth of the tree.