Question

What is heap file organization?

(a) Any record can be placed wherever there is a space for the record

(b) Records are stored in a sequential order according to a search key

(c) A hash function is computed on some attribute and that decides the block

(d) None of the mentioned

I got this question in homework.

This intriguing question comes from Organization of Records in Files topic in section Storage and File Structure of RDBMS

Answer 1

Right option is (a) Any record can be placed wherever there is a space for the record

Easy explanation: Heap file organization means that any record can be placed wherever there is space for that record. There is no ordering of records. Typically there is a single file for each relation.