B+ tree dense index

Question

Database table (R) consist 1000 records. The number of minimum B⁺ tree index blocks required to build dense B⁺tree index for relation (R) are _________. Assume order of B⁺ tree root node atleast 1 key atmost 12 key and other nodes of B⁺ tree order atleast 6 keys and atmost 12 keys.

Answer 1

90 blocks will be required.

in lask laevel all 1000 records will be there so it will occupy 84 blocks , n need 84 block pointers in second last level each block will give 13 block pointers so 5 blocks are required as in first level one block is required.

total is 84+5+1= 90

Comments

At second level , its 84/13 = 6.46 = 6 complete blocks + 7th block

So, 7 blocks at second level .

 

So, its 84 + 7 + 1 = 92