0% found this document useful (0 votes)
10 views3 pages

Dbs Final Points

not know

Uploaded by

Emperior K29
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views3 pages

Dbs Final Points

not know

Uploaded by

Emperior K29
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

ch 7 points:

1. Database Design Process


2. Database Schema Design
3. Application Programs Design
4. Database Requirements
5. Conceptual Schema
6. Physical Design
7. Logical Design
8. Entity-Relationship (ER) Model
9. ER Schema Diagrams
10. Entities and Attributes
11. Simple Attributes
12. Composite Attributes
13. Multi-valued Attributes
14. Stored vs Derived Attributes
15. Entity Types
16. Key Attributes
17. Entity Set
18. Relationships
19. Relationship Types
20. Relationship Set
21. Relationship Instance
22. Recursive Relationship Type
23. Weak Entity Types
24. Constraints on Relationships
25. Cardinality Ratio
26. Existence Dependency Constraint
27. (min, max) Notation
28. Attributes of Relationship Types
29. UML Class Diagrams
30. Aggregation
31. Relationships of Higher Degree
32. Ternary Relationships
33. Extended Entity-Relationship (EER) Model
34. Specialization and Generalization

-----------------------------------------------------------------------------------
ch 8:
Based on the content of the slides, here is a list of key database concepts you
need to cover:

1. Enhanced ER (EER) Model


2. Subclasses
3. Superclasses
4. Specialization
5. Generalization
6. Categories (UNION Types)
7. Attribute and Relationship Inheritance
8. IS-A Relationships
9. Disjointness Constraint
10. Completeness Constraint
11. Predicate-Defined Subclass
12. Attribute-Defined Specialization
13. User-Defined Specialization
14. Specialization/Generalization Hierarchies
15. Lattices
16. Shared Subclasses
17. Generalization vs. Specialization
18. Data Modeling with Specialization and Generalization
19. Top-Down Conceptual Refinement Process
20. Bottom-Up Conceptual Synthesis Process
21. General Conceptual Modeling Concepts
22. Classification and Instantiation
23. Aggregation and Association
24. Generalization and Specialization
25. Identification
26. Constraints
27. Cardinality (Min and Max)
28. Coverage (Total vs. Partial, Exclusive (Disjoint) vs. Overlapping)
29. Ontologies
30. Ontology Languages and Tools
31. Summary and Formal Definitions of EER Model

-----------------------------------------------------------------------------------
----------------------------------

ch 9:
Schema Mapping (Logical Database Design)
ER-to-Relational Mapping Algorithm
Step 1: Mapping of Regular Entity Types
Step 2: Mapping of Weak Entity Types
Step 3: Mapping of Binary 1:1 Relation Types
Step 4: Mapping of Binary 1:N Relationship Types
Step 5: Mapping of Binary M:N Relationship Types
Step 6: Mapping of Multivalued Attributes
Step 7: Mapping of N-ary Relationship Types
Mapping EER Model Constructs
Options for Mapping Specialization or Generalization
Mapping of Union Types (Categories)
Data Model Mapping Phase of Relational DB Design
Conceptual Schema Design
Logical Database Design Phase

-----------------------------------------------------------------------------------
-------------------------------------

ch 15
Informal Design Guidelines for Relational Databases

Semantics of the Relation Attributes


Redundant Information in Tuples and Update Anomalies
Null Values in Tuples
Spurious Tuples
Functional Dependencies (FDs)

Definition of Functional Dependency (FD)


Inference Rules for FDs
Equivalence of Sets of FDs
Minimal Sets of FDs
Normalization of Relations

First Normal Form (1NF)


Second Normal Form (2NF)
Third Normal Form (3NF)
Boyce-Codd Normal Form (BCNF)
Definitions of Keys and Attributes Participating in Keys

Superkey
Candidate Key
Primary Key
Prime Attribute
Nonprime Attribute
Normal Forms Based on Primary Keys

Full Functional Dependency


Transitive Functional Dependency
General Normal Form Definitions (For Multiple Keys)

General Definition of 2NF


General Definition of 3NF
Achieving BCNF by Decomposition

Decomposition Process
Ensuring Non-additive (Lossless) Join Property

You might also like