Sample Problem from Relational Database Design
Normalization In-Class Examples
Given a list of functional dependencies
followed by a table design, determine for each of the following
examples:
- the candidate key(s)
- the prime attributes
- the normal form the relation is in and
why
- the third normal for decomposition if the
relation is not already in third normal form. (Also show the
second normal form if the relation is in first.)
FLIGHT,DAY->PILOT. FLIGHT->GATE.
FLIGHT = {FLIGHT, DATE, PILOT, GATE)
WORKER->NAME. WORKER->SALARY. PROJECT->END-DATE. WORKER->PROJECT.
WORKER = {WORKER, PROJECT, SALARY, END-DATE}
INVOICE#->DATE. DESCRIPTION->PRICE. LINE-ITEM->DESCRIPTION.
INVOICE={INVOICE#, DATE, LINEITEM M, DESCRIPTION, PRICE}
PROD#->COST. PROD#->PROD-DEPT. PROD-DEPT->DEPT-DESCRIPTION.
PRODUCT = {PROD#, COST, PROD-DEPT, DEPT-DESCRIPTION}
SHIPMENT#->WAREHOUSE. SHIPMENT#->WEIGHT. WAREHOUSE->ADDRESS.
SHIPMENT = { SHIPMENT#, WAREHOUSE, WEIGHT, ADDRESS }
TRUCK#->MILES-DRIVEN. DRIVER#->LICENSE-DATE.
TRUCK-DRIVER = { TRUCK#, DRIVER#, MILES-DRIVEN, LICENSE-DATE }
Return the course description.
|