Insertion is not expensive: records must be inserted in the correct order.

A binary search can not be used to search for a record on its ordering field value.

Reading the records in order of the ordering field is not quite efficient.

Hashing for disk files is called Internal Hashing

The Hashed Files are divided into M equal-sized buckets

More than one of the file fields is designated to be the hash key of the file.