In database indexing, which scenario benefits MOST from using a B+ Tree ?
2026
In database indexing, which scenario benefits MOST from using a B+ Tree ?
Answer: B. Range queries — B+ Trees excel in range queries because all data pointers are stored at leaf nodes, allowing efficient sequential access.
- A.
Random access only
- B.
Range queries
- C.
Small datasets
- D.
Write-heavy workloads
Attempted by 307 students.
Show answer & explanation
Correct answer: B
B+ Trees excel in range queries because all data pointers are stored at leaf nodes, allowing efficient sequential access.
Loading lesson…