Database management systems notes
Functional Dependencies
The precise statement of "this determines that", and how to compute what a set of them implies. Every section is a drawn page beside a clear written explanation, about 22 minutes in all.
- Chapter 13 of 34
- About 22 minutes
- 8 sections
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
In this chapter
- What a functional dependency says
- Reading dependencies out of a description
- Armstrong’s axioms
- Attribute closure: the algorithm to know
- Finding every candidate key
- Canonical cover: the same rules, stated minimally
- Why a dependency causes an anomaly
- A full worked analysis
Next chapters
Read the whole chapter
Sign in and the chapter opens with every drawn page, and all 35 database management systems chapters beside it.
DSA comes with the all labs plan and every ChaiCode batch.