Discussion
In database indexing, which scenario benefits MOST from using a B+ Tree ?
Answer: B
B+ trees benefit Range queries most.
In a B+ tree all keys are stored in the leaf nodes in sorted order, and the leaves are linked to one another. A range query finds the first key by descending the tree once, then reads the rest by following the leaf links, without returning to the root.
A hash index serves random point lookups as well or better. Small datasets gain little from any index, and write-heavy workloads suffer from the cost of keeping the tree balanced on every insert and delete.
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