Question discussion

In RDBMS, B+trees are preferred to binary trees since

2886Hard DSSSB TGT Computer Science 0 replies 1 views

0

In RDBMS, B+trees are preferred to binary trees since

ADisk capacities are higher than memory capacities
BMemory access is faster than disk access
CDisks are more reliable than memory
DNone of the above

Correct answer: A

Explanation

B+ trees are shallow, wide trees that reduce disk accesses; this matters because the data resides on disk, whose capacity is far higher than memory.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!