Scribd
Upload
121 views2 pages

Assignment #2 - 2132

This document provides details for an assignment on database normalization. It includes 3 exercises. Exercise 1 has 7 parts asking students to analyze a schema with functional dependencies, find candidate keys, determine if the schema is in BCNF, and decompose the schema into BCNF. Exercise 2 has 3 parts asking students to find candidate keys, generate a cover of functional dependencies, and decompose the schema into 3NF. Exercise 3 asks students to identify functional dependencies for a moving company schema, determine candidate keys, and normalize the schema to BCNF.

Uploaded by

Ren3r
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
121 views2 pages

Assignment #2 - 2132

This document provides details for an assignment on database normalization. It includes 3 exercises. Exercise 1 has 7 parts asking students to analyze a schema with functional dependencies, find candidate keys, determine if the schema is in BCNF, and decompose the schema into BCNF. Exercise 2 has 3 parts asking students to find candidate keys, generate a cover of functional dependencies, and decompose the schema into 3NF. Exercise 3 asks students to identify functional dependencies for a moving company schema, determine candidate keys, and normalize the schema to BCNF.

Uploaded by

Ren3r
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

School of Electrical Engineering and Computer Science

CSI2132 – Databases I
Winter 2021
Assignment 2

Instructor: Paula Branco


Announced: March 16th 2021
Submission: March 26th 2021 (11:30pm EDT)

Every student must submit the assignment as a pdf file individually through Brightspace.

Exercise 1 (53%)

Consider the schema R = (U, V, W, X, Y, Z) and the set F of functional dependencies:


F = { U → VW, UX → Y, VX → Y, WX → UV }
a) (3%) Explain if the functional dependency UY→ V holds.
b) (5%) Find a nontrivial functional dependency containing no extraneous attributes that is
logically implied by the above four dependencies and explain how you found it.
c) (10%) Find all candidate keys of R.
d) (5%) Show that schema R is not in BCNF.
e) (10%) Find a BCNF decomposition of R. Start with U → VW and explain your steps.
f) (10%) For your decomposition, state whether it is lossless and explain why.
g) (10%) For your decomposition, state whether it is dependency preserving and explain why.

Exercise 2 (25%)

Consider the schema R = (U, V, W, X, Y, Z)and the set F of functional dependencies:


F = { UV → WX, UXY → ZXY, V → ZW, Z → XY }
a) (5%) Provide a list of all candidate keys.
b) (10%) Find the canonical cover for F, along with an explanation of the steps you took to
generate it.
c) (10%) Generate a 3NF decomposition of R (show all the necessary steps).

Exercise 3 (22%)

The GetMoving company asked your team to build a database. The company provided your
team the following header of a table with the information they want to store in relation moving.
They also provided the following description of the attributes: Team_ID is the unique identifier of
each team; Team_Location is the specific city where a Team is located; Orig_city and Dest_city
are the cities of origin and destination of a moving contract; the Dist_Estim is an estimate of the
distance of the moving; the Load_Estim is the total estimation of the load for a moving contract;
and the Quote is the quote value provided to the client for a given moving.
Team_ID Team_Location Orig_City Dest_City Dist_Estim Load_Estim Quote

For the relation moving, you are also asked to consider the following information related with
functional dependencies:
FD1: “The company has several different moving teams that are located in different cities across
Canada. The Moving company is able to determine the specific city where each team is located
using the Team_ID.”
FD2: “ The distance estimates are calculated using the origin and destination cities.”
FD3: “The company calculates a quote for the moving service using the distance (in miles) and
load (in lbs) estimated values.”

Based on the information provided above answer the following questions:

a) (3%) Identify the 3 functional dependencies described above (FD1, FD2 and FD3).
b) (6%) Based on your functional dependencies in 3(a), specify all candidate keys for the
relation moving.
c) (13%) Normalize the relation to Boyce Codd Normal Form and show the resulting relations.
(Note: For questions 3 b) and c) you can simplify the names of the attributes. Just indicate
clearly the correspondence that you are using. For instance, Team_ID will be attribute A, etc.)

You might also like