Consider the following table Flight 101 101 Airline Delta Delta Delta CSA CSA CSA 102 725...

Transcribed Image Text:

Consider the following table Flight 101 101 Airline Delta Delta Delta CSA CSA CSA 102 725 101 102 Gate G05 G05 G10 G07 G32 G05 Passenger P510 P530 P510 P620 P530 P510 Ticket t10634 t16274 t26037 +36207 t40371 t62470 Suppose the table contains all the instances of the relation. Find all the functional dependencies that can be inferred from the relation. Clearly state any reasonable assumptions that you choose to make. What is the highest form of this relation? Consider three buffer replacement polices: Least Recently Used (LRU), Most Recently Used (MRU) and First In First Out (FIFO). Construct an example that, for the same query set, FIFO performs the worst in one buffer size and performs the best in another buffer size. Justify your answer, and explain why if it does not exist. Consider the following table Flight 101 101 Airline Delta Delta Delta CSA CSA CSA 102 725 101 102 Gate G05 G05 G10 G07 G32 G05 Passenger P510 P530 P510 P620 P530 P510 Ticket t10634 t16274 t26037 +36207 t40371 t62470 Suppose the table contains all the instances of the relation. Find all the functional dependencies that can be inferred from the relation. Clearly state any reasonable assumptions that you choose to make. What is the highest form of this relation? Consider three buffer replacement polices: Least Recently Used (LRU), Most Recently Used (MRU) and First In First Out (FIFO). Construct an example that, for the same query set, FIFO performs the worst in one buffer size and performs the best in another buffer size. Justify your answer, and explain why if it does not exist.