1 / 9
Télécharger la présentation

Relational Database Design Algorithms and Normal Forms: A Comprehensive Study

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 11 Relational Database Design Algorithms and Further Dependencies

  2. Properties of Relational Decompositions • Relation Decomposition and Insufficiency of Normal Forms • Dependency Preservation Property of a Decomposition • Lossless (Nonadditive) Join Property of a Decomposition • Testing Binary Decomposition for the Nonadditive Join Property • Successive Lossless (Nonadditive) Join Decompositions

  3. Algorithms for Relational Database Schema Design • Dependency-Preserving Decomposition into 3NF Schemas • Lossless (Nonadditive) Join Decomposition into BCNF Schemas • Dependency-Preserving and Nonadditive (Lossless) Join Decomposition into 3NF Schemas • Problems with Null Values and Dangling Tuples • Discussion of Normalization Algorithms

  4. Multivalued Dependencies and Fourth Normal Form • Formal Definition of Multivalued Dependency • Inference Rules for Functional and Multivalued Dependencies • Fourth Normal Form • Lossless (Nonadditive) Join Decomposition into 4NF Relations

  5. Join Dependencies and Fifth Normal Form

  6. Inclusion Dependencies

  7. Other Dependencies and Normal Forms • Template Dependencies • Domain-Key Normal Form

  8. Summary

More Related