Database-Management-System
August 29, 2024Software-Engineering
August 29, 2024B-Trees
| Question 2 |
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:
| θ(log n h*t) | |
| θ(log t n*h) | |
| θ(log h n) | |
| θ(log t n) |
Question 2 Explanation:
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 θ(log t n).
Note: B-Tree search operation best,average and worst case will take θ(logn).
Note: B-Tree search operation best,average and worst case will take θ(logn).
Correct Answer: D
Question 2 Explanation:
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 θ(log t n).
Note: B-Tree search operation best,average and worst case will take θ(logn).
Note: B-Tree search operation best,average and worst case will take θ(logn).
Subscribe
Login
0 Comments