recategorized
1,565 views
0 votes
0 votes

The order of a leaf node in a $B^{+}$ tree is the maximum number of children it can have. Suppose that block size is $1$ kilobytes, the child pointer takes $7$ bytes long and search field value takes $14$ bytes long. The order of the leaf node is _________.

  1. $16$
  2. $63$
  3. $64$
  4. $65$
recategorized

3 Answers

3 votes
3 votes
data pointer = child pointer + search field value = 14+7 = 21B

so max number of children it can have = 1KB/21B = 1024/21 = 48.76 = 48(approx)

All other options are greater than the 48 can go with option 1 as asnwer
0 votes
0 votes
$key size*(n-1)+n*child pointer \leqslant block size$

$14*(n-1)+7*n \leqslant 1024$

$21*n-14\leqslant1024$

$21*n\leqslant1038$

$n\leqslant1038/21$

$n\leqslant49.42$

$n$  should be less than $49.42$

i think ans should be Option A($16\leqslant49.42$)
Answer:

Related questions

1 votes
1 votes
2 answers
1
go_editor asked Mar 24, 2020
1,173 views
An attribute $A$ of datatype varchar $(20)$ has value 'Ram' and the attribute $B$ of datatype char $(20)$ has value 'Sita' in oracle. The attribute $A$ has ________ memor...