Consider the relation schema R = {A, B, C, D, E, F, G} and the following set Σ of FDs: • C → BG • AE → F • CF → EA • A → DF 1. What are the candidate keys of R? Justify your answer (i.e., include the main steps used for finding the candidate keys). 2. Find a minimal cover of Σ and include the main steps used for finding a minimal cover. 3. Demonstrate why R, given Σ, does not satisfy 3NF, and then identify a 3NF decomposition for R. You need to include the main steps used for identifying the 3NF decomposition
Please help me in this problem of Relational
Consider the relation schema R = {A, B, C, D, E, F, G} and the following set Σ of FDs:
• C → BG
• AE → F
• CF → EA
• A → DF
1. What are the candidate keys of R? Justify your answer (i.e., include the main steps used for finding
the candidate keys).
2. Find a minimal cover of Σ and include the main steps used for finding a minimal cover.
3. Demonstrate why R, given Σ, does not satisfy 3NF, and then identify a 3NF decomposition for R.
You need to include the main steps used for identifying the 3NF decomposition
Step by step
Solved in 5 steps
Please solve nd tell me te answer of relational
Consider the relation schema Booking={Airline, Date, Destination, FlightNo, PassengerName, Origin,
PassportNo, Seat, Terminal} and the following set Σ of FDs:
• Airline → Terminal
• FlightNo → Airline, Origin, Destination
• PassportNo → PassengerName
• FlightNo, PassportNo, Date → Seat
• FlightNo, Date, Seat → PassportNo
Which, for brevity, we can alias the attributes and restate as Booking={A, D, E, F, N, O, P, S, T} and Σ:
• A → T
• F → AOE
• P → N
• FPD → S
• FDS → P
1. Is the above relation schema Booking in BCNF? If not, identify a BCNF decomposition for Booking
and check if your BCNF decomposition is dependency-preserving. You need to include the main steps
used for identifying the BCNF decomposition.
2. Consider another set Σ1 of FDs on Bookings:
• Airline → Terminal
• FlightNo → Airline, Origin, Destination
• PassportNo → PassengerName
• FlightNo, PassportNo, Date → Terminal, Seat
• FlightNo, Date, Seat → PassportNo, PassengerName
Which can be similarly aliased as:
• A → T
• F → AOE
• P → N
• FPD → TS
• FDS → PN
Are Σ and Σ1 equivalent? Justify your answer.
by Bartleby Expert
