Computer Science · Database Management Systems
Which of the following statements regarding B-trees and B++-trees is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1B+-trees store data only in main memory, whereas B-trees store data on secondary disk storage
- 2Range queries are faster and more efficient on B+-trees because data pointers are linked at the leaf level✓
- 3B-trees are used exclusively for primary indexes, while B+-trees are used exclusively for secondary indexes
- 4The height of a B+-tree is independent of the total number of records
Correct answer
Range queries are faster and more efficient on B+-trees because data pointers are linked at the leaf level
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems