Describe direct (random) access files in terms of hashing algorithms, overflow areas, and the need for files to be re-organized on occasions (6)?
The physical location of the record is calculated using a hashing algorithm, This calculation is carried out on data in the key field, A data collision occurs when two data items are hashed to the same location, In this case there needs to be an overflow area where the latest data is stored, When there are many items in the overflow area, access may become slow, In which case a new hashing algorithm is required and a larger file may be needed.