CH 16 - Disk Storage, Basic File Structures, Hashing, and Modern Storage Architectures

Question 1

16.6 Files of Unordered Records (Heap Files)

Answer 1

• In this simplest and most basic type of organization, records are placed in the file in the order in which they are inserted, so new records are inserted at the end of the file.
• Inserting a new record is very efficient.
• searching for a record using any search condition involves a linear search t

Question 2

16.7 Files of Ordered Records (Sorted Files)

Answer 2

• We can physically order the records of a file on disk based on the values of one of their fields—called the ordering field.
• irst, reading the records in order of the ordering key values becomes extremely efficient because no sorting is required.
• Inserting and deleting records are expensive operations for a