1. 8-1 © Prentice Hall, 2007 Chapter 8: Object-Relational Modeling Object-Oriented Systems Analysis and Design Joey F. George, Dinesh Batra, Joseph S. Valacich, Jeffrey A. Hoffer

2. Chapter 8 8-2 © Prentice Hall, 2007 Chapter Objectives – Understand the relational model. – Normalize data to the third normal form. – Understand the object-oriented extensions to the relational model. – Realize the role of object relations in systems analysis. – Translate a conceptual data model into object relations. – Integrate object relations obtained from different use cases.

3. Chapter 8 8-3 © Prentice Hall, 2007

4. Chapter 8 8-4 © Prentice Hall, 2007 Object-relational data modeling converts a conceptual data model to a logical data model based on relational and object-oriented technology.

5. Chapter 8 8-5 © Prentice Hall, 2007 Purposes of Object-Relational Modeling Produce database structures Create entity classes Enhance and finalize the attributes in the data model

6. Chapter 8 8-6 © Prentice Hall, 2007 What Is a Relational Data Model? Based on the concept of relations (tables of data) Relationships established by matching primary and foreign keys Relational DBMSs (RDBMS) are the most commonly used in industry today. Many DBMS vendors have begun adding object- oriented features, creating an object-relational model.

7. Chapter 8 8-7 © Prentice Hall, 2007 What Is a Relation? A named, two-dimensional table with the following properties: – All cells contain are atomic (single-value) data. – Entries in columns are from the same set of values (domain range). – Each row is unique (i.e. has a nonempty primary key). – Column order does not matter. – Row order does not matter. This is called First Normal Form (1NF)

8. Chapter 8 8-8 © Prentice Hall, 2007 Example relation: note uniqueness of rows guaranteed by Emp_ID. Primary keys are underlined

9. Chapter 8 8-9 © Prentice Hall, 2007 What Is Normalization? The process of converting complex data structures into well-structured relations Well-structured relation – a relation that contains a minimum amount of redundancies and allows rows to be inserted, modified, and deleted without introducing errors or inconsistencies

10. Chapter 8 8-10 © Prentice Hall, 2007 Consequences of Relations that Are Not Well Structured Insertion anomaly – adding new rows forces user to create duplicate data Update anomaly – changes in one row force changes in other rows because of duplication Deletion anomaly – deleting rows may cause a loss of data that would be needed for other future rows Data integrity requires well-structured relations.

11. Chapter 8 8-11 © Prentice Hall, 2007 The Normal Forms 1 st NF – all relations are in 1NF 2 nd NF – relations with no partial-key functional dependencies 3 rd NF – relations with no transitive functional dependencies Higher normal forms: 4 th, Boyce Codd, 5 th – mainly theoretical, not needed for most OOSAD problems Main goal is to achieve 3NF for all relations.

12. Chapter 8 8-12 © Prentice Hall, 2007 What Is a Functional Dependency? The functional dependency of attribute B on attribute A is represented by an arrow A  B, and implies that every valid value of attribute A uniquely determines the value of attribute B. Determinant – the attribute on the left side of the arrow All primary keys are determinants

13. Chapter 8 8-13 © Prentice Hall, 2007 Second Normal Form (2NF) 1NF, plus no partial key functional dependencies If the primary key is a composite key (composed of more than one attribute) it is possible for an attribute to be functionally dependent on only part of the key Avoid partial dependencies for 2NF

14. Chapter 8 8-14 © Prentice Hall, 2007 This table has a composite key (Emp_ID and Course) Functional dependencies: Emp_ID  Name, Dept, Salary Emp_ID, Course  Date_Completed Name, Dept, and Salary all have partial key dependencies, causing duplication of data.

15. Chapter 8 8-15 © Prentice Hall, 2007 Solution: Break the relation into two separate relations. 1:N relationship linked by Emp_ID No partial key dependencies Well structured

16. Chapter 8 8-16 © Prentice Hall, 2007 Third Normal Form (3NF) 2NF, plus no transitive functional dependencies Given three attributes in a relation A, B, C, if A  B and B  C, this forms a transitive functional dependency Avoid transitive dependencies for 3NF

17. Chapter 8 8-17 © Prentice Hall, 2007 Here, Customer_ID  Salesperson, and Salesperson  Region, cause a transitive dependency

18. Chapter 8 8-18 © Prentice Hall, 2007 Break the relation into two separate relations. 1:N relationship linked by SalesPerson No transitive dependencies Well structured Solution:

19. Chapter 8 8-19 © Prentice Hall, 2007 Primary and Foreign Keys Primary key – one or more attributes that together form a unique identifier for rows in the relation Foreign key – an attribute that appears as a non- primary key attribute or as part of a primary key in one relation and as a primary key attribute in another relation Relationship – rows in one relation are matched with related rows in another relation through foreign keys

20. Chapter 8 8-20 © Prentice Hall, 2007 Referential Integrity A rule that states that any foreign key value (on the relation of the many side) MUST match a primary key value in the relation of the one side No foreign key can contain a value that is not present in a primary key in the other relation

21. Chapter 8 8-21 © Prentice Hall, 2007 Object-Oriented Extensions to Relational Modeling – Generalization – Multivalued attributes (OK to violate atomicity requirement of 1NF) – Aggregation – Object identifiers – Pointers – Behaviors – Richer set of data types Object-relational Data Model

22. Chapter 8 8-22 © Prentice Hall, 2007 Translating Conceptual Data Model to Object-Relational Model Translate classes Translate relationships Normalize object relations Merge object relations

23. Chapter 8 8-23 © Prentice Hall, 2007 Relational approach, forces atomic attributes Object-relational approach, with multivalued attribute Comparison of techniques for translating multivalued attributes

24. Chapter 8 8-24 © Prentice Hall, 2007 When constructing 1:N relationships, the foreign key is added as an attribute to the relation on the N side.

25. Chapter 8 8-25 © Prentice Hall, 2007 Associative class and M:N relationship

26. Chapter 8 8-26 © Prentice Hall, 2007 Points for Figure 8.11 Associative class is translated into a relation whose primary key is a composite of the primary keys of the other two classes. M:N relationship between Work and Skill is implemented as an extra relation UseSkills, whose primary key is composed of the primary keys of Work and Skill.

27. Chapter 8 8-27 © Prentice Hall, 2007 Unary 1:N relationship is represented by a foreign key managerID, which matches with the empId primary key of the same relation.

28. Chapter 8 8-28 © Prentice Hall, 2007 Unary M:N relationship is represented by a separate relation Prerequisite, whose primary key is composed of two primary key values from the Course relation.

29. Chapter 8 8-29 © Prentice Hall, 2007 Other Relationships Aggregation and Composition – use same rules that apply to association. Composition is 1:N, aggregation is M:N Generalization – no uniform standard exists. Can make use of stereotypes to annotate generalizations

30. Chapter 8 8-30 © Prentice Hall, 2007 Merging Object Relationships Similar or redundant object relations can be merged into one Example: merge

31. Chapter 8 8-31 © Prentice Hall, 2007 Problems with Merging Synonyms – two relations with different attribute names referring to same meaning – Solution – decide on a single standard name Homonyms – two relations with same attribute names referring to different meanings – Solution – create new attribute for second meaning Dependencies between non-key attributes after merge – Solution – normalize the merged relation