Question

What is hashing 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 had been asked this question in an online interview.

My enquiry is from Organization of Records in Files topic in chapter Storage and File Structure of RDBMS

Answer 1

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

To explain: Hashing file organization means that a hash function is computed on some attribute and that decides the block. The result of the hash function specifies which block of the file the record should be placed in.