Relational database design algorithms

Chapter 7 discusses how to design a relational database schema based on a conceptual schema design. This chapter presented a high-level view of the database design process, and in this chapter we focus on the logical database design or data model mapping step of database design. We present the procedures to create a relational schema from an Entity-Relationship (ER) or an Enhanced ER (EER) schema.

32p kiepnaybinhyen_04 15-12-2015 85 4   Download

Chapter 11 present the contents: Designing a set of relations, properties of relational decompositions, algorithms for relational database schema, multivalued dependencies and fourth normal form, join dependencies and fifth normal form, inclusion dependencies, other dependencies and normal forms.

43p kiepnaybinhyen_04 15-12-2015 51 2   Download

Relation Decomposition and Insufficiency of Normal Forms (cont.): Attribute preservation condition: Each attribute in R will appear in at least one relation schema Ri in the decomposition so that no attributes are “lost”. Another goal of decomposition is to have each individual relation Ri in the decomposition D be in BCNF or 3NF. Additional properties of decomposition are needed to prevent from generating spurious tuples

66p thienthanoze 12-11-2012 69 5   Download