The GATE Grind

GATE 2024 CS (CS2) – Question 26

Databases · File Organization and Indexing (B and B+ Trees) · 1 mark · Multiple select

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?

  1. Sorted
  2. Heap
  3. Unclustered tree index
  4. Unclustered hash index

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) Sorted; (B) Heap

Explanation

Sorted and heap files store records contiguously, giving efficient sequential scans. Unclustered indexes cause a random I/O per record.