8,293 views
8 votes
8 votes

Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below.

Search key field = $12$ field

Record pointer = $10$ bytes

Block pointer = $8$ bytes

Block size = $1$KB

  1. $P_{leaf}$ = 51 & p = 46
  2. $P_{leaf}$ = 47 & p = 52
  3. $P_{leaf}$ = 46 & p = 51
  4. $P_{leaf}$ = 52 & p = 47

2 Answers

Best answer
19 votes
19 votes

option c is the ans

selected by
5 votes
5 votes

Answer c)

Pleaf

1*BP + (Pleaf )*(key+Recrd Pointer) <= Block size

Pleaf<=46.18

Pnonleaf

P*Block Pointer +(P-1)*(Key) <= Block Size

Pnonleaf <=51.8

Answer:

Related questions

8 votes
8 votes
2 answers
1
makhdoom ghaya asked Apr 27, 2016
5,363 views
The physical location of a record determined by a formula that transforms a file key into a record location isHashed file$B$-Tree fileIndexed fileSequential file
8 votes
8 votes
5 answers
2
makhdoom ghaya asked May 2, 2016
7,256 views
Embedded pointer providesA secondary access pathA physical record keyAn inverted indexA primary key
8 votes
8 votes
1 answer
3