1,202 views
1 votes
1 votes
DB file consists of 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). How many minimum index blocks are required for sparse B+ tree index?

I think the answer should be (417/10) + (42/11) +(4/11) = 42 + 4 + 1 = 47 (Assuming order of leaf and internal nodes are same as they are not given separately). Am I correct?

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
2
Himanshu1 asked Jan 2, 2016
3,037 views
0 votes
0 votes
0 answers
3
2 votes
2 votes
1 answer
4
Anjan asked Dec 29, 2017
972 views
Every ________ index is Clustereda)primaryb)secondary