edited by
11,277 views
26 votes
26 votes

The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $6$ bytes, the search field value takes $14$ bytes, and the block size is $512$ bytes. What is the order of the internal node?

  1. $24$
  2. $25$
  3. $26$
  4. $27$
edited by

2 Answers

20 votes
20 votes

Answer: C

lets assume order of b+ tree is n.

B+ tree internal node has  n-1 keys and n node (child) pointer.

 

Given : key size: 14 bytes
 
Child pointer : 6 bytes
 
we have ,
 
block size = (n-1) * key size + n * child pointer
512>=(n-1)*14+n*6
512>=14n-14+6n
n=(512+14)/20
n=526/20
n=26.3
n=26
Answer:

Related questions