Database-Management-System
October 4, 2023Database-Management-System
October 4, 2023Database-Management-System
| Question 130 |
B+-trees are preferred to binary trees in databases because
| Disk capacities are greater than memory capacities | |
| Disk access is much slower than memory access | |
| Disk data transfer rates are much less than memory data transfer rates | |
| Disks are more reliable than memory |
Question 130 Explanation:
In B+ trees it is easy to reduce the number of last level access from the disk when the disk size is too large.
Correct Answer: B
Question 130 Explanation:
In B+ trees it is easy to reduce the number of last level access from the disk when the disk size is too large.
Subscribe
Login
0 Comments