Question

Considering B+ tree with the following parameters i Size of one data ntry = 20 bytes; Page size = 4096 bytes; 96 bytes are reserved for bit map = Total number of records 100,000; record size = 40 bytes a. If the B+ tree is dense and unclustered, what is the I/O cost for a range select with Reduction Factor = 0.1? b. If the B+ tree is sparse, what is the I/O cost for a range select with Reduction Factor= 0.1? c. If the B+ tree is dense and clustered, what is the I/O cost for a range select with Reduction lctor = 0.1 ?
​

Answer 1

Answer:

I can't understand the question

Answer 2

So, height would be log2(106)=19.93=20
And accesses would be 21


This is what I did. Which was incorrect in hindsight.



This is a B+ tree, it need not have two children. Number of children, at max = 205 (as calculated)

Hence, height of the tree = log205(106)=2.59=3
. And accesses would be 4