






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An in-depth exploration of functional dependencies in database systems, focusing on different normal forms, functional dependency theory, closure of a set of dependencies, and decomposition. Learn about armstrong's axioms, multivalued dependencies, and how to convert relations into the boyce-codd normal form (bcnf).
Typology: Slides
1 / 12
This page cannot be seen from the preview
Don't miss anything!







(Part 3)
lending = ( branch_name, branch_city, assets, customer_name, loan_number, amount )
Candidate Key: { loan_number, customer_name } Functional Dependencies: branch_name → assets branch_city loan_number → amount branch_name
branch_name → assets branch_city Valid but branch_name is not a superkey, therefore it is not in BCNF!
lending = ( branch_name, branch_city, assets, customer_name, loan_number, amount ) Decomposes to multiple relations: branch = ( branch_name, branch_city, assets ) loan_info = ( branch_name, customer_name, loan_number, amount )
lending = ( branch_name, branch_city, assets, customer_name, loan_number, amount )
branch = ( branch_name, branch_city, assets ) loanb = ( loan_number, branch_name, amount ) borrower = ( customer_name, loan_number )
The Original Functional Dependencies: branch_name → assets branch_city loan_number → amount branch_name
Everything is now in BCNF!
α →→ β Means a tuple must exist for every value in β
Class = { CS 157, CS 46 }
Books = { Manual, Solution }
CID class books 10 CS 46 Manual 10 CS 46 Solution 20 CS 157 Manual 20 CS 157 Solution
Multivalued dependencies result in duplicate data and are considered “tuple-generating dependencies”.
Formal definition – see page 295