Skip to:Content
|
Bottom
Cover image for Data modeling and database design
Title:
Data modeling and database design
Personal Author:
Publication Information:
Boston, MA : Thomson/Course Technology, 2007
Physical Description:
xxi, 698 p. : ill. ; 24 cm.
ISBN:
9781423900832
Added Author:

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010160821 QA76.9.D26 U42 2007 Open Access Book Book
Searching...

On Order

Summary

Summary

Data Modeling and Database Design presents a conceptually complete coverage of indispensable topics that each MIS student should learn if that student takes only one database course. Database design and data modeling encompass the minimal set of topics addressing the core competency of knowledge students should acquire in the database area. The text, rich examples, and figures work together to cover material with a depth and precision that is not available in more introductory database books.


Author Notes

Dr. Narayan S. Umanath is Professor of Information Systems at the University of Cincinnati, Ohio
Dr. Richard W. Scamell serves as Professor of Decision and Information Sciences in the C. T. Bauer College of Business at the University of Houston


Table of Contents

Prefacep. xv
Chapter 1 Database Systems: Architecture and Componentsp. 1
1.1 Data, Information, and Metadatap. 1
1.2 Data Managementp. 2
1.3 Limitations of File-Processing Systemsp. 3
1.4 The ANSI/SPARC Three-Schema Architecturep. 5
1.5 Characteristics of Database Systemsp. 8
1.5.1 What Is a Database System?p. 10
1.5.2 What Is a Database Management System?p. 11
1.5.3 Advantages of Database Systemsp. 13
1.6 Data Modelsp. 14
1.6.1 Data Models and Database Designp. 15
1.6.2 The Database Design Life Cyclep. 16
Chapter Summaryp. 19
Exercisesp. 20
Selected Bibliographyp. 21
Part I Conceptual Data Modeling
Chapter 2 Foundation Conceptsp. 26
2.1 A Conceptual Modeling Frameworkp. 26
2.2 ER Modeling Primitivesp. 26
2.3 Foundations of the ER Modeling Grammarp. 28
2.3.1 Entity Types and Attributesp. 28
2.3.2 Entity and Attribute-Level Data Integrity Constraintsp. 30
2.3.3 Relationship Typesp. 33
2.3.4 Structural Constraints of a Relationship Typep. 38
2.3.5 Base Entity Types and Weak Entity Typesp. 49
2.4 Data Modeling Errorsp. 54
2.4.1 Vignette 1p. 54
2.4.2 Vignette 2p. 60
2.4.3 Vignette 3p. 61
Chapter Summaryp. 68
Exercisesp. 69
Selected Bibliographyp. 73
Chapter 3 Entity-Relationship Modelingp. 75
3.1 Bearcat Incorporated: A Case Studyp. 75
3.2 Applying the ER Modeling Grammar to the Conceptual Modeling Processp. 77
3.2.1 The Presentation Layer ER Modelp. 78
3.2.2 The Presentation Layer ER Model for Bearcat Incorporatedp. 81
3.2.3 The Coarse-Granular Design-Specific ER Modelp. 95
3.2.4 The Fine-granular Design-Specific ER Modelp. 106
Chapter Summaryp. 113
Exercisesp. 113
Selected Bibliographyp. 118
Chapter 4 Enhanced Entity-Relationship (EER) Modelingp. 119
4.1 Superclass/subclass Relationshipp. 119
4.1.1 Vignette 1p. 120
4.1.2 A Motivating Exemplarp. 124
4.1.3 General Properties of a Superclass/subclass Relationshipp. 125
4.1.4 Specialization and Generalizationp. 126
4.1.5 Specialization Hierarchy and Specialization Latticep. 133
4.1.6 Categorizationp. 136
4.1.7 Choosing the Appropriate EER Constructp. 139
4.1.8 Aggregationp. 144
4.2 Converting from the Presentation Layer to a Design-Specific EER Diagramp. 146
4.3 Bearcat Incorporated Data Requirements Revisitedp. 148
4.4 ER Model for the Revised Storyp. 149
Chapter Summaryp. 157
Exercisesp. 157
Selected Bibliographyp. 162
Chapter 5 Modeling Complex Relationshipsp. 163
5.1 The Ternary Relationship Typep. 164
5.1.1 Vignette 1-Madeira Collegep. 164
5.1.2 Vignette 2-Get Well Pharmacists, Inc.p. 169
5.2 Beyond the Ternary Relationship Typep. 171
5.2.1 The Case for a Cluster Entity Typep. 171
5.2.2 Vignette 3-More on Madeira Collegep. 172
5.2.3 Vignette 4-A More Complex Entity Clusteringp. 176
5.2.4 Cluster Entity Type-Additional Examplesp. 179
5.2.5 Madeira College-The Rest of the Storyp. 182
5.2.6 Clustering a Recursive Relationship Typep. 186
5.3 The Weak Relationship Typep. 190
5.4 Composites of Weak Relationship Typesp. 196
5.4.1 Inclusion Dependency in Composite Relationship Typesp. 196
5.4.2 Exclusion Dependency in Composites of Weak Relationship Typesp. 197
5.5 Decomposition of Complex Relationship Constructsp. 198
5.5.1 Decomposing Ternary and Higher-Order Relationship Typesp. 198
5.5.2 Decomposing a Relationship Type with a Multi-valued Attributep. 200
5.5.3 Decomposing a Cluster Entity Typep. 204
5.5.4 Decomposing a Weak Relationship Typep. 206
5.6 Validation of the Conceptual Designp. 209
5.6.1 Fan Trapp. 210
5.6.2 Chasm Trapp. 213
5.6.3 Miscellaneous Semantic Trapsp. 216
5.7 Cougar Medical Associatesp. 221
5.7.1 Conceptual Model for CMA: The Genesisp. 223
5.7.2 Conceptual Model for CMA: The Next Generationp. 228
5.7.3 The Design-Specific ER Model for CMA: The Final Frontierp. 229
Chapter Summaryp. 236
Exercisesp. 236
Selected Bibliographyp. 240
Part II Logical Data Modeling
Chapter 6 The Relational Data Modelp. 244
6.1 Definitionp. 244
6.2 Characteristics of a Relationp. 245
6.3 Data Integrity Constraintsp. 247
6.3.1 The Concept of Unique Identifiersp. 248
6.3.2 Referential Integrity Constraint in the Relational Data Modelp. 252
6.4 A Brief Introduction to Relational Algebrap. 254
6.4.1 Unary Operations: Selection ([sigma]) and Projection ([pi])p. 254
6.4.2 Binary Operations: Union (U), Difference (-), and Intersection ([Characters not reproducible])p. 256
6.4.3 The Natural Join (*) Operationp. 258
6.5 Views and Materialized Views in the Relational Data Modelp. 259
6.6 The Issue of Information Preservationp. 260
6.7 Mapping an ER Model to a Logical Schemap. 261
6.7.1 Information-Reducing Mapping of ER Constructsp. 261
6.7.2 An Information-Preserving Mappingp. 277
6.8 Mapping Enhanced ER Model Constructs to a Logical Schemap. 281
6.8.1 Information-Reducing Mapping of EER Constructsp. 281
6.8.2 Information-Preserving Grammar for Enhanced ER Modeling Constructsp. 289
Chapter Summaryp. 296
Exercisesp. 298
Selected Bibliographyp. 304
Part III Normalization
Chapter 7 Functional Dependenciesp. 308
7.1 A Motivating Exemplarp. 308
7.2 Functional Dependenciesp. 314
7.2.1 Definition of Functional Dependencyp. 314
7.2.2 Inference Rules for Functional Dependenciesp. 315
7.2.3 Minimal Cover for a Set of Functional Dependenciesp. 317
7.2.4 Closure of a Set of Attributesp. 322
7.2.5 Whence Do FDs Arise?p. 323
7.3 Candidate Keys Revisitedp. 324
7.3.1 Deriving Candidate Key(s) by Synthesisp. 325
7.3.2 Deriving Candidate Keys by Decompositionp. 329
7.3.3 Deriving a Candidate Key-Another Examplep. 332
7.3.4 Prime and Non-prime Attributesp. 336
Chapter Summaryp. 340
Exercisesp. 340
Selected Bibliographyp. 344
Chapter 8 Normal Forms Based on Functional Dependenciesp. 345
8.1 Normalizationp. 345
8.1.1 First Normal Form (1NF)p. 346
8.1.2 Second Normal Form (2NF)p. 347
8.1.3 Third Normal Form (3NF)p. 351
8.1.4 Boyce-Codd Normal Form (BCNF)p. 354
8.1.5 Side Effects of Normalizationp. 357
8.1.6 Summary Notes on Normal Formsp. 367
8.2 The Motivating Exemplar Revisitedp. 369
8.3 A Comprehensive Approach to Normalizationp. 372
8.3.1 Case 1p. 373
8.3.2 Case 2p. 380
8.3.3 Case 3p. 386
8.4 Denormalizationp. 391
8.5 Role of Reverse Engineering in Data Modelingp. 392
8.5.1 Reverse Engineering the Normalized Solution of Case 1p. 394
8.5.2 Reverse Engineering the Normalized Solution of Case 2p. 399
8.5.3 Reverse Engineering the Normalized Solution of Case 3p. 401
Chapter Summaryp. 406
Exercisesp. 407
Selected Bibliographyp. 416
Chapter 9 Higher Normal Formsp. 417
9.1 Multi-valued Dependencyp. 417
9.1.1 A Motivating Exemplar for Multi-valued Dependencyp. 417
9.1.2 Multi-valued Dependency Definedp. 419
9.1.3 Inference Rules for Multi-valued Dependenciesp. 420
9.2 Fourth Normal Form (4NF)p. 422
9.3 Resolution of a 4NF Violation-A Comprehensive Examplep. 425
9.4 Generality of Multi-valued Dependencies and 4NFp. 428
9.5 Join Dependencies and Fifth Normal Form (5NF)p. 429
9.6 A Note on Domain-Key Normal Form (DK/NF)p. 434
Chapter Summaryp. 435
Exercisesp. 435
Selected Bibliographyp. 439
Part IV Database Implementation Using the Relational Data Model
Chapter 10 Database Creationp. 444
10.1 Data Definition Using SQLp. 444
10.1.1 Base Table Specification in SQL/DDLp. 445
10.1.2 Specification of User-Defined Domainsp. 462
10.1.3 Schema and Catalog Concepts in SQL/DDLp. 466
10.2 Data Population Using SQLp. 469
10.2.1 The Insert Statementp. 470
10.2.2 The Delete Statementp. 472
10.2.3 The Update Statementp. 474
10.3 Access Control in the SQL-92 Standardp. 475
10.3.1 The Grant and Revoke Statementsp. 476
10.3.2 Some Examples of Granting and Revoking Privilegesp. 477
Chapter Summaryp. 486
Exercisesp. 487
Selected Bibliographyp. 492
Chapter 11 Data Manipulation: Relational Algebra and SQLp. 493
11.1 Relational Algebrap. 493
11.1.1 Unary Operatorsp. 496
11.1.2 Binary Operatorsp. 499
11.2 Structured Query Language (SQL)p. 516
11.2.1 SQL Queries Based on a Single Tablep. 518
11.2.2 SQL Queries Based on Binary Operatorsp. 543
11.2.3 Subqueriesp. 557
Chapter Summaryp. 572
Exercisesp. 573
SQL Projectsp. 577
Selected Bibliographyp. 577
Chapter 12 Advanced Data Manipulation Using SQLp. 579
12.1 Assertions, Triggers, and Viewsp. 579
12.1.1 Specifying an Assertion in SQLp. 579
12.1.2 Triggers in SQLp. 585
12.1.3 Specifying Views in SQL/DDLp. 598
12.1.4 The Division Operationp. 601
12.2 SQL-92 Built-in Functionsp. 604
12.2.1 The Substring Functionp. 606
12.2.2 The Char_Length (char) Functionp. 608
12.2.3 The Trim Functionp. 610
12.2.4 The Translate Functionp. 614
12.2.5 The Position Functionp. 614
12.2.6 Combining the INSTR and SUBSTR Functionsp. 616
12.3 Some Brief Comments on Handling Dates and Timesp. 617
12.4 A Potpourri of Other SQL Queriesp. 622
12.4.1 Concluding Example 1p. 622
12.4.2 Concluding Example 2p. 624
12.4.3 Concluding Example 3p. 626
12.4.4 Concluding Example 4p. 626
12.4.5 Concluding Example 5p. 627
12.4.6 Concluding Example 6p. 628
Chapter Summaryp. 629
Exercisesp. 629
SQL Project 1

p. 630

SQL Project 2

p. 639

SQL Project 3

p. 645

Selected Bibliographyp. 652
Appendix A Data Modeling Architectures Based on the Inverted Tree and Network Data Structuresp. 653
A.1 Logical Data Structuresp. 653
A.1.1 Inverted Tree Structurep. 653
A.1.2 Network Data Structurep. 654
A.2 Logical Data Model Architecturesp. 655
A.2.1 Hierarchical Data Modelp. 656
A.2.2 CODASYL Data Modelp. 660
Summaryp. 663
Selected Bibliographyp. 663
Appendix B Object-Oriented Data Modeling Architecturesp. 665
B.1 The Object-Oriented Data Modelp. 665
B.1.1 Overview of OO Conceptsp. 666
B.1.2 A Note on UMLp. 669
B.2 The Object-Relational Data Modelp. 671
Summaryp. 672
Selected Bibliographyp. 672
Appendix C Overview of SQL Reserved Wordsp. 673
Appendix D SQL Select Statement Featuresp. 683
Indexp. 689
Go to:Top of Page