M Taimoor Khan

Course Objectives 1) Basic Concepts 2) Tools 3) Database architecture and design 4) Flow of data (DFDs) 5) Mappings (ERDs) 6) Formulating queries (Relational algebra) 7) Implementing Schema 8) Built-in Functions 9) Extracting data 10) Working with Joins 11) Normalization 12) Improving performance 13) Advanced topics

Normalization o Why Normalization o Functional Dependency o Armstrong’s Axioms o First Normal Form (1NF) o Second Normal Form (2NF) o Third Normal Form (3NF) o Boyce - Codd Normal Form (BCNF)

Inference Rules  Called inference axioms or armstrong axioms  These are rules that establish certain FDs from a given set of FDs  These rules are sound

Reflexivity  If B is a subset of A then A B, it also implies that A A always hold, that is stName, stAdr stName Or stName stName

Augmentation  If we have A B then AC BC that is if stId stName then stId, stAdr stName, stAdr

Transitivity  If A B and B C then A C that is If stId prName and prName credits Then stId credits

Additivity or Union  If A B and A C then A BC if empId eName and empId qual Then we can write it as empId eName, qual

Projectivity or Decomposition  If A BC then A B and A C if empId eName, qual Then we can write it as empId eName and empId qual

Pseudotransitivity  If A B and CB D then AC D if stId stName and stName, fName stAdr Then we can write it as stId, fName stAdr

Normalization Why Normalization Functional Dependency Armstrong’s Axioms o First Normal Form (1NF) o Second Normal Form (2NF) o Third Normal Form (3NF) o Boyce - Codd Normal Form (BCNF)

Lab Activity-12  Sort a Query  Sort multiple columns in a query  Query with two or more tables  Save a query  Create a parameter query

Next Lecture  Normalization