Finding things Quickly VI: The limitations of Binary Search and Internal Sorting
Binary Search requires more than one or two accesses. Accessing a record using the RRN can be done with a single access ==> We would like to achieve RRN retrieval performance while keeping the advantage of key access.
Keeping a file sorted is very expensive: in addition to searching for the right location for the insert, once this location is founds, we have to shift records to open up the space for insertion.
Internal Sorting only works on small files. ==> Keysorting