File Organizations
- Heap files: Suitable when typical access is a file scan retrieving all records.
- Sorted Files: Best if records must be retrieved in some order, or only a `range’ of records is needed.
- Hashed Files: Good for equality selections.
- File is a collection of buckets. Bucket = primary page plus zero or more overflow pages.
- Hashing function h: h(r) = bucket in which record r belongs. h looks at only some of the fields of r, called the search fields.