Fourth Edition: Designing Databases

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 14

Essentials of

Systems Analysis and Design


Fourth Edition
Joseph S. Valacich
Joey F. George
Jeffrey A. Hoffer

Chapter 4
Designing Databases

9.1
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Learning Objectives
✓ 1 The data on all forms and reports
✓ Vrai

✓ 2 Invoices and mailing labels


✓ faux

✓ 3 All methodologies incorporate only one


✓ faux

✓ 4 Data cannot move directly a source


✓ Vrai

✓ 5 Since data-flow diagrams concentrate


✓ Process models

9.2
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Learning Objectives (continued)

✓ 6 Cardinality is the number of instances


✓ Vrai

✓ 7 One of the primary purposes of a DFD


✓ faux

✓ 8 The minimum cardinality of relationship


✓ vrai

✓ 9 Conceptual data modeling is typically done


✓ Systems analysis

✓ 10 In the systems development life cycle


✓ vrai
9.3
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Learning Objectives (continued)

✓Explain choices of storage formats for


database tables
✓Learn how to transform well-structured
relations into efficient database tables
✓Discuss use of different types of file
organizations to store database files
✓ Discuss indexes and their purpose
9.4
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Process of Database Design
✓ 11 During logical design, the analyst
✓ faux

✓ 12 The primary deliverable from the


✓ An entity-relationship diagram

✓ 13 The output of the systems planning


✓ a baseline project plan

✓ 14 Data contained on a customer


✓ Data flow

✓ 15 When preparing an initial prototype


✓ faux

9.5 Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall


9.6
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Process of Database Design
(continued)
✓ 16 Which of the following
✓ A data model explains

✓ 17 The decomposition of Process


✓ faux

✓ 18 A data-flow diagram that represents


✓ Level-0 diagram

✓ 19 By placing a data store


✓ Decouples the processes

✓ 20 Which of following is NOT a true


✓ A data flow can go directly back to the same pro..

Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall


9.7
Process of Database Design
(continued)
✓ 21 A DFD that result
✓ Level-3 diagram

✓ 22 The conservation of inputs


✓ Balancing

✓ 23 If a data flow appears in tne context


✓ Balancing

✓ 24 CASE software
✓ Tool

✓ 25 If an input from a source


✓ Appear on the context diagram

9.8
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Deliverables and Outcomes
Logical database design must account
for every data element, system input or
output
Normalized relations are the primary
deliverable
Physical database design results in
converting relations into files

9.9
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Relational Database Model
✓ 26 If your DFD contains data
✓ Conplete

✓ 27 Which of the following is NOT a sys


✓ Scope

✓ 28 The extent to which all necessary con


✓ DFD conpleteness

✓ 29 If entity B is a mandatory
✓ The minimum cardinality of the …. one

✓ 30 A ‘many’ maximum
✓ Placing a crow’s foot notation

9.10 © 2009 Pearson Education, Inc. Publishing as Prentice Hall


Relational Database Model
(continued)
✓ 31 Having a level-1 diagram with no
✓ Violation of consistency

✓ 32 When you believe that you


✓ Primitive data-flow diagrams

✓ 33 The process of discovering


✓ Gap analysis

✓ 34 During which of the following steps


✓ Alternative generation and selection

✓ 35 Enumerating different potentiel


✓ Shapping alternative system design strategies phase

9.11
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Normalization
✓ 36 The number of instances of entity B
✓ cardinatity

✓ 37 Techniques used for modeling


✓ Decision tables

9.12
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Summary
Key Terms
◼ Relation
◼ Primary key
◼ Functional dependency
◼ Foreign key
◼ Referential integrity
◼ Field
◼ Data type
◼ Denormalization
◼ File organization
◼ Index
9.50 ◼ Secondary key
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall
Summary (continued)
Transforming E-R diagram into well-
structured relations
View Integration
Storage Formats for Database Fields
Efficient Database Table Design
◼ Efficient use of secondary storage
◼ Data processing speed
File Organization
Indexes
Internet Development
9.51
Copyright © 2009 Pearson Education, Inc. Publishing as Prentice Hall

You might also like