1What is the correct hierarchical order of information storage in a relational database, from largest to smallest?
2In a heap file implemented as a linked list, if there are 5 full pages and 10 pages with free space, and we know at least one page has enough space for a new record, what is the maximum number of pages you might need to read to find a suitable page?
3Consider a heap file using a page directory with 8 entries per header page. If there are a total of 15 data pages (including full ones), what is the maximum number of header pages you would need to read to find a page with enough free space?
4Which workload is best suited for a heap file compared to a sorted file?
5Which workload benefits most from using a sorted file over a heap file?
6Given the `Inventory` table schema with `item_id` (INT), `quantity` (INT), and `item_description` (TEXT), and a 64 KB page, what is the maximum number of variable-length records that can fit? Assume 10 bytes for the footer and 8 bytes per record for the slot directory (pointer + length). Integers are 4 bytes.
7For a record in the `Inventory` table, what is the minimum size in bits, considering `item_id` (INT), `quantity` (INT), and `item_description` (TEXT)? Assume each record has a 4-byte header and a 32-bit pointer to the end of variable-length fields. Integers and floats are 4 bytes.
8Consider the `Students` table. If it's stored as a heap file, which query execution order has the lowest I/O cost in the average case (ascending order)?
9Consider the `Students` table sorted on `sid`. Which query execution order has the lowest I/O cost in the average case (ascending order)? (Queries: A: Range scan on `years_enrolled`, B: Delete by `sid`, C: Insert)
10Calculate the size of a single tuple for the `Students` table using fixed-length records. Assume `sid` (INT), `name` (VARCHAR(20)), `email` (VARCHAR(20)), `GPA` (float), and `years_enrolled` (INT). Integers and floats are 4 bytes. VARCHARs are stored with their maximum length.
