Discussion
Which of the following ensures minimal disk accesses in B-tree searches ?
Answer: B
Minimal disk accesses come from a large fan-out (order).
A B-tree node is usually sized to fill one disk block, and each node visited costs one disk access. A search reads one node per level, so the number of accesses equals the tree's height. Giving each node a large order, hundreds of keys and children per block, makes the tree very shallow: a B-tree of order 200 can index millions of keys in three or four levels.
Low height is the result of the large fan-out, not a separate mechanism. Root splitting is simply how a B-tree grows by one level, and B-tree nodes are fixed-size blocks, not variable-sized.
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