1.2k views

The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the minimum degree, is

1. $\theta (\log_n h*t)$
2. $\theta (\log_t n*h)$
3. $\theta (\log_h n)$
4. $\theta (\log_t n)$

recategorized | 1.2k views

The number of disk pages accessed by B-TREE-SEARCH is  Θ(h) =Θ(logt n), where h is the height of the B-tree and n is the number of keys in the B-tree.

Hence, Option 4 is correct.

by (187 points)

1
2