book

Database Design Using Entity-Relationship Diagrams, 3rd Edition

Name: Database Design Using Entity-Relationship Diagrams, 3rd Edition
ISBN: 9781000642704

by Sikha Saha Bagui, Richard Walsh Earp

September 2022

Intermediate to advanced

388 pages

8h 16m

English

Auerbach Publications

Read now

Unlock full access

Cover
Half Title
Title
Copyright
Dedication
Contents
Preface
Acknowledgments
Authors
Introduction

Chapter 1 Data, Databases, and the Software Engineering Process
1.1 Introduction1.2 Data1.3 Building a Database1.4 What Is the Software Engineering Process?1.5 Entity-Relationship Diagrams and the Software Engineering Life Cycle1.5.1 Phase 1: Get the Requirements for the Database1.5.2 Phase 2: Specify the Database1.5.3 Phase 3: Design the Database1.6 Chapter SummaryChapter 1 ExercisesBibliography
Chapter 2 Data and Data Models
2.1 Introduction2.2 Files, Records, and Data Items2.3 Moving From 3 × 5 Cards to Computers2.4 Database Models2.4.1 The Hierarchical Model2.4.1.1 The Hierarchical Model with a Linked List2.4.1.2 Relationship Terminology2.4.1.3 Drawbacks of the Hierarchical Model2.5 The Network Model2.6 The Relational Model2.7 Chapter SummaryBibliography
Chapter 3 The Relational Model and Functional Dependencies
3.1 Introduction3.2 Fundamentals of Relational Database3.3 Relational Database and Sets3.4 Functional Dependency3.5 Non-1NF to 1NF3.6 The Second Normal Form3.6.1 Anomalies3.6.2 Non-2NF to 2NF3.7 The Third Normal Form3.8 The Equijoin Operation3.9 Some Functional Dependency Rules3.10 The Boyce–Codd Normal Form3.11 Chapter SummaryChapter 3 ExercisesBibliography
Chapter 4 The Basic ER Diagram: A Data Modeling Schema
4.1 Introduction4.2 What Is a Data Modeling Schema?4.2.1 What Is an Entity-Relationship Diagram?4.3 Defining a Database—Some Definitions: Entity, Relationship, and Attribute4.3.1 A Beginning Methodology4.3.2 ER Design Methodology4.4 A First “Entity-Only” ER Diagram: An Entity with Attributes4.5 More about Attributes4.5.1 The Simple or Atomic Attribute4.5.2 The Composite Attribute4.5.3 The Multivalued Attribute4.5.4 The Derived Attribute4.5.5 Keys4.6 English Description of the Entity4.6.1 The Method4.6.1.1 The Entity4.6.1.2 The Attributes4.6.1.3 The Keys4.6.2 ER Design Methodology4.6.3 Examples4.6.3.1 Figure 4.3 Example4.6.3.2 Figure 4.4 Example4.6.3.3 Figure 4.5a Example4.6.3.4 Figure 4.6 Example4.6.3.5 Figure 4.7 Example4.7 Mapping the Entity Diagram to a Relational Database4.8 Chapter SummaryChapter 4 ExercisesCase StudyNotesBibliography
Chapter 5 Beyond the First Entity Diagram
5.1 Introduction5.2 Examining an Entity: Changing an Attribute to Be an Entity5.3 Defining a Relationship for Our New Entity5.3.1 ER Design Methodology5.4 A Preliminary Grammar for ER Diagrams5.4.1 The Relationship5.5 Defining a Second Entity5.6 Does a Relationship Exist?5.7 Attribute or Relationship?5.7.1 ER Design Methodology5.8 Chapter SummaryChapter 5 ExercisesCase StudyBibliography
Chapter 6 Extending Relationships/Structural Constraints
6.1 Introduction6.2 The Cardinality Ratio of a Relationship6.2.1 One to One (1:1)6.2.2 Many to One (M:1)6.2.3 One to Many (1:M)6.2.4 Many to Many (M:N)6.3 Participation: Full/Partial6.4 English Descriptions6.5 Tighter English6.5.1 Pattern 1—x:y::k:16.5.2 Pattern 2—x:y::k:16.5.3 Pattern 3—x:y::k:M6.5.4 Pattern 4—x:y::k:M6.5.5 Summary of the Patterns and Relationships6.5.5.1 Pattern 16.5.5.2 Pattern 16.5.5.3 Pattern 26.5.5.4 Pattern 26.5.5.5 Pattern 36.5.5.6 Pattern 36.5.5.7 Pattern 46.5.5.8 Pattern 46.5.6 ER Design Methodology6.6 Some Examples of Other Relationships6.6.1 An Example of the One-to-Many Relationship (1:M)6.6.1.1 Pattern 4–1:M, From the 1 Side, Partial Participation6.6.1.2 Pattern 2—M(Partial):1, From M Side, Optional Participation6.6.2 An Example of the Many-to-One Relationship (M:1)6.6.2.1 Pattern 1—M:1, From the M Side, Full Participation6.6.2.2 Pattern 3–1:M, From the 1 Side, Full Participation6.6.3 An Example of the Many-to-Many Relationship (M:N)6.6.3.1 Pattern 3—M:N, From the M Side, Full Participation6.6.3.2 Pattern 4—N:M, From the N Side, Partial Participation6.7 One Final Example6.7.1 ER Design Methodology6.7.1.1 The Entity6.7.1.2 The Entity6.7.2 Pattern 1—M:1, From the M Side, Full Participation6.7.3 Pattern 3–1:M, From the 1 Side, Full Participation6.8 Mapping Relationships to a Relational Database6.8.1 Mapping Binary M:N Relationships6.8.2 Mapping Binary 1:1 Relationships6.8.3 Mapping Binary 1:N Relationships6.9 Chapter SummaryChapter 6 ExercisesCase StudyNoteBibliography
Chapter 7 The Weak Entity
7.1 Introduction7.2 Strong and Weak Entities7.3 Weak Entities and Structural Constraints7.4 Weak Entities and the Identifying Owner7.4.1 Another Example of a Weak Entity and the Identifying Owner7.5 Weak Entities Connected to Other Weak Entities7.6 Revisiting the Methodology7.7 Weak Entity Grammar7.7.1 The Keys7.8 Mapping Weak Entities to a Relational Database7.9 Chapter SummaryChapter 7 ExercisesCase StudyBibliography
Chapter 8 Further Extensions for ER Diagrams with Binary Relationships
8.1 Introduction8.2 Attributes of Relationships8.2.1 The Attributes8.3 Relationships Developing into Entities: The M:N Relationship Revisited8.3.1 The Entity8.3.1.1 The Attributes8.3.1.2 The Keys8.4 More Entities and Relationships8.4.1 More Than Two Entities8.4.1.1 Pattern 4—x:y::1:M, From the 1 Side, Partial Participation8.4.1.2 Pattern 1—x:y::M:1, From the M Side, Full Participation8.4.2 Adding More Attributes That Evolve into Entities8.5 More Evolution of the Database8.6 Attributes That Evolve into Entities8.7 Recursive Relationships8.7.1 Recursive Relationships and Structural Constraints8.7.1.1 One-to-One Recursive Relationship (Partial Participation on Both Sides)8.7.1.2 One-to-Many Recursive Relationship (Partial Participation on Both Sides)8.7.1.3 Many-to-Many Recursive Relationship (Partial on Both Sides)8.8 Multiple Relationships8.9 The Derived or Redundant Relationship8.10 Optional: An Alternative ER Notation for Specifying Structural Constraints on Relationships8.11 Review of the Methodology8.11.1 ER Design Methodology8.11.2 The Entity8.11.2.1 The Attributes8.11.2.2 The Keys8.12 Mapping Rules for Recursive Relationships8.13 Chapter SummaryChapter 8 ExercisesCase StudyBibliography
Chapter 9 Ternary and Higher-Order ER Diagrams
9.1 Introduction9.2 Binary or Ternary Relationship?9.3 Structural Constraints for Ternary Relationships9.3.1 Many to Many to Many (M1:M2:M3)9.4 An Example of an n-ary Relationship9.5 n-ary Relationships Do Not Preclude Binary Relationships9.6 Methodology and Grammar for the n-ary Relationship9.6.1 A More Exact Grammar9.6.1.1 Pattern 3—M:N, From the M Side, Full Participation9.6.1.2 Pattern 3—k:M, from the k Side, Full Participation (k = 1 or N)9.6.1.3 Pattern 5 (n-ary)—x:y:z::a:b:c, From the a Side, Full/Partial Participation9.6.2 Grammar in a Partial Participation, Ternary Relationship with an M1:1:M2 Relationship9.7 Ternary Relationships From Relationship-Relationship Situations9.8 n-ary Relationships That May Be Resolved into Binary Relationships9.9 Mapping n-ary Relationships to a Relational Database9.10 Review of the Methodology9.10.1 ER Design Methodology9.11 Chapter SummaryChapter 9 ExercisesBibliography
Chapter 10 The Enhanced Entity-Relationship (EER) Model
10.1 Introduction10.2 What Is a Generalization or Specialization?10.3 Variants10.4 Examples of Generalizations or Specializations10.5 Methodology and Grammar for Generalization/Specialization Relationships10.6 Mapping Rules for Generalizations and Specializations10.6.1 Mapping Rule 1510.6.2 Mapping Rule 1610.6.3 Mapping Rule 1710.6.4 Mapping Rule 1810.7 Subclasses of Subclasses10.7.1 Mapping Rule 1910.8 Categories or Union Types10.8.1 Participation Ratios in Categories or Union Types10.8.2 Mapping Categories or Union Types When Superclasses Have the Same Primary Keys10.8.3 Mapping Categories or Union Types When Superclasses Have Different Primary Keys10.9 Final ER Design Methodology10.9.1 ER Design Methodology10.10 Chapter SummaryChapter 10 ExercisesCase StudyBibliography
Chapter 11 Relational Mapping and Reverse Engineering ER/EER Diagrams
11.1 Introduction11.2 Steps Used to Map ER/EER Diagrams to Relational Databases11.3 Reverse Engineering11.3.1 Reverse Engineering Rule 1. Develop Strong Entities11.3.2 Reverse Engineering Rule 2. Look for 1:1 and 1:N (1:x) Relationships11.3.3 Reverse Engineering Rule 2a. Check for Attributes of the 1:x Relationship11.3.4 Reverse Engineering Rule 3. Look for Weak Entities and Multivalued Attributes11.3.5 Reverse Engineering Rule 3a. Checking for Weak Entities11.3.6 Reverse Engineering Rule 3b. Checking for Multivalued Attributes11.3.7 Reverse Engineering Rule 4. Check for M:N and n-ary Relationships11.3.8 Reverse Engineering Rule 4a. Check for the Binary Case11.3.9 Reverse Engineering Rule 4b. Check for the n-ary Case11.3.10 Reverse Engineering Rule 5. Check for Generalization/Specialization Relationships11.3.11 Reverse Engineering Rule 5a. Check for Generalization/Specialization Relationships with Disjoint or Overlap Relationships with Total or Partial Participation Constraints11.3.12 Reverse Engineering Rule 5b. Check for Disjoint Generalization/Specialization Relationships with Single-Predicate-Defined Attributes11.3.13 Reverse Engineering Rule 5c. Check for Overlap Generalization/Specialization Relationship with More Than One Flag11.3.14 Reverse Engineering Rule 6. Check for Shared Subclasses11.3.15 Reverse Engineering Rule 7. Check for Categories or Union Types11.4 Chapter SummaryChapter 11 ExercisesBibliography
Chapter 12 A Brief Overview of the Barker/Oracle-Like Model
12.1 Introduction12.2 A First “Entity-Only” ER Diagram: An Entity with Attributes12.3 Attributes in the Barker/Oracle-Like Model12.3.1 Optional versus Mandatory Attributes12.4 Relationships in the Barker/Oracle-Like Model12.5 Structural Constraints in the Barker/Oracle-Like Model12.6 Dealing with the Concept of the Weak Entity in the Barker/Oracle-Like Model12.7 Dealing with the Concept of Multivalued Attributes in the Barker/Oracle-Like Model12.8 Treatment of Foreign Keys12.9 Recursive Relationships in the Barker/Oracle-Like Model12.10 Mapping M:N Relationships12.11 Chapter SummaryChapter 12 ExercisesBibliography
Glossary
Index

Overview

Thoroughly revised and updated, this third edition covers, in an intuitive, way, the database design process, from the inception of a database to effectively mapping the design to a relational model, which can then be implemented in any relational software. Students also learn how to reverse engineer a database from relational mappings.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Database Design Using Entity-Relationship Diagrams, 2nd Edition

Publisher Resources

ISBN: 9781000642704

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills