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

A scan reads all records. With sorted and heap file organizations, the data pages can be traversed directly, using the records on each page before moving on. Both therefore support efficient full-file scans.

An unclustered index orders index entries rather than the underlying data records. Following its record pointers can revisit scattered data pages, causing many extra I/Os when retrieving the complete records.

Select **A and B**. Efficient scanning does not require every page to occupy physically consecutive disk sectors; the benefit is page-oriented access to the data file.

More File Organization and Indexing (B and B+ Trees) questions

All File Organization and Indexing (B and B+ Trees) questions →