We have the following relation: Subscriptions(ID, startingdate, length, customerID, customerName, address) with the following functional dependencies: ID → startingdate length customerID customerName address customerID → customerName address Compute the closures of the left-hand sides of the dependencies and determine whether the relation is in BCNF. Justify your answer briefly. If the relation is not in BCNF, decompose the relation into new relations that are. Use the decomposition algorithm taught in the course. For each partitioning, use the form below to provide the dependency you are partitioning over, the new partitions, their projected dependencies and the closures of said dependencies in the new relation. Also determine whether those relations are in BCNF and give some justification.
We have the following relation:
Subscriptions(ID, startingdate, length, customerID, customerName, address)
with the following functional dependencies:
ID → startingdate length customerID customerName address
customerID → customerName address
Compute the closures of the left-hand sides of the dependencies and determine whether the relation is in BCNF. Justify your answer briefly.
If the relation is not in BCNF, decompose the relation into new relations that are.
Use the decomposition
For each partitioning, use the form below to provide the dependency you are partitioning over, the new partitions, their projected dependencies and the closures of said dependencies in the new relation.
Also determine whether those relations are in BCNF and give some justification.
Step by step
Solved in 2 steps with 2 images