B+ -trees are preferred to binary trees in databases because
2000
B+ -trees are preferred to binary trees in databases because
- A.
Disk capacities are greater than memory capacities
- B.
Disk access is much slower than memory access
- C.
Disk data transfer rates are much less than memory data transfer rates
- D.
Disks are more reliable than memory
Attempted by 52 students.
Show answer & explanation
Correct answer: B
Database records are usually stored on disks. Since disk access is much slower than memory access, database structures should minimize the number of disk reads and writes.
A B+ Tree has:
High branching factor (many children per node)
Small tree height
Fewer levels to traverse
As a result, fewer disk accesses are required to locate a record.
Therefore, B+ Trees are preferred over binary trees in databases.
Answer: B) Disk access is much slower than memory access