📜  门| GATE-CS-2017(Set 2)|第60章

📅  最后修改于: 2021-06-29 20:36:56             🧑  作者: Mango

在B +树中,如果搜索键值长8个字节,块大小为512个字节,块指针为2个字节,则B +树的最大顺序为____。

注意:此问题显示为“数值答案类型”。
(A) 51
(B) 52
(C) 53
(D) 54答案: (B)
解释:

Order of a B+ tree node is maximum number of children 
in an internal node

Let the order be x. Number of keys in a node is equal to
number children minus 1.
So a full node has (x-1) keys and x children.

(x-1)*(search key) + x * block ptr <= block size
==> (x-1)*8 + x*2 <= 512
==> 10x <= 520
==> x <= 52

这个问题的测验