Discussion
Select the correct option :
Answer: C
The correct statement is range queries are faster on a B\(^{+}\)-tree.
In a B\(^{+}\)-tree all records (or record pointers) are in the leaves, which are linked in key order. A range query finds the first key and then follows the leaf links, without returning up the tree.
The height of a B\(^{+}\)-tree does depend on the number of records, growing logarithmically. Both structures can be used for primary or secondary indexes, and both are designed for disk-based storage, so the other statements are false.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development