Database chapter 05 full lecture notes, Lecture notes of Database Programming

Hoeffer lecture notes full database systems.

Typology: Lecture notes

2016/2017

Uploaded on 11/12/2017

usama-ayub
usama-ayub šŸ‡µšŸ‡°

4.5

(2)

4 documents

1 / 37

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CHAPTER 5:
CHAPTER 5:
PHYSICAL DATABASE DESIGN AND
PHYSICAL DATABASE DESIGN AND
PERFORMANCE
PERFORMANCE
Ā© 2013 Pearson Education, Inc. (Publishing as
Prentice Hall 1
Modern Database Management
11th Edition
Jeffrey A. Hoffer, V. Ramesh,
Heikki Topi
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25

Partial preview of the text

Download Database chapter 05 full lecture notes and more Lecture notes Database Programming in PDF only on Docsity!

CHAPTER 5:CHAPTER 5:

PHYSICAL DATABASE DESIGN AND PHYSICAL DATABASE DESIGN AND

PERFORMANCE PERFORMANCE

Ā© 2013 Pearson Education, Inc. Publishing as Prentice Hall 1

Modern Database Management

th

Edition

Jeffrey A. Hoffer, V. Ramesh, Heikki Topi

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

OBJECTIVES OBJECTIVES

Define termsDefine terms

Describe the physical database designDescribe the physical database design

process process

Choose storage formats for attributesChoose storage formats for attributes

Select appropriate file organizationsSelect appropriate file organizations

Describe three types of file organizationDescribe three types of file organization

Describe indexes and their appropriate useDescribe indexes and their appropriate use

Translate a database model into efficientTranslate a database model into efficient

structures structures

Know when and how to use denormalizationKnow when and how to use denormalization

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

PHYSICAL DESIGN PROCESS PHYSICAL DESIGN PROCESS

Normalized relations

Volume estimates

Attribute definitions

Response time

expectations

Data security needs

Backup/recovery needs

Integrity expectations

DBMS technology used

Inputs

Attribute data types

Physical record

descriptions (doesn’t always

match logical design)

File organizations

Indexes and database

architectures

Query optimization

Leads to

Decisions

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

PHYSICAL DESIGN FOR PHYSICAL DESIGN FOR

REGULATORY REGULATORY

COMPLIANCE COMPLIANCE

Sarbanes- Oxley Act (SOX) – protectSarbanes- Oxley Act (SOX) – protect

investors by improving accuracy and investors by improving accuracy and

reliability reliability

Committee of Sponsoring OrganizationsCommittee of Sponsoring Organizations

(COSO) of the Treadway Commission (COSO) of the Treadway Commission

IT Infrastructure Library (ITIL)IT Infrastructure Library (ITIL)

Control Objectives for Information andControl Objectives for Information and

Related Technology (COBIT) Related Technology (COBIT)

Regulations and standards that impact physical design decisions

Figure 5-1 Composite usage map (Pine Valley Furniture Company) (cont.) Data volumes

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

8 Figure 5-1 Composite usage map (Pine Valley Furniture Company) (cont.) Access Frequencies (per hour)

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

Figure 5-1 Composite usage map (Pine Valley Furniture Company) (cont.) Usage analysis: 7500 suppliers accessed per hour  4000 quotations accessed from these 7500 supplier accesses  4000 purchased parts accessed from these 4000 quotation accesses

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

DESIGNING FIELDS DESIGNING FIELDS

Field: smallest unit of applicationField: smallest unit of application

data recognized by system data recognized by system

software software

Field designField design

Choosing data typeChoosing data type

Coding, compression, encryptionCoding, compression, encryption

Controlling data integrityControlling data integrity

Figure 5-2 Example of a code look-up table (Pine Valley Furniture Company)

Code saves space, but

costs an additional lookup

to obtain actual value

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

FIELD DATA INTEGRITY FIELD DATA INTEGRITY

Default value–assumed value if noDefault value–assumed value if no

explicit value explicit value

Range control–allowable value limitationsRange control–allowable value limitations

(constraints or validation rules) (constraints or validation rules)

Null value control–allowing or prohibitingNull value control–allowing or prohibiting

empty fields empty fields

Referential integrity–range control (andReferential integrity–range control (and

null value allowances) for foreign-key to null value allowances) for foreign-key to

primary-key match-ups primary-key match-ups

Sarbanes-Oxley Act (SOX) legislates importance of financial data integrit

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

DENORMALIZATION DENORMALIZATION

ļƒ’ TransformingTransforming normalizednormalized relations intorelations into non-non- normalized normalized physical record specificationsphysical record specifications ļƒ’ (^) Benefits:Benefits:

ļƒ’ Can improve performance (speed) by reducing number ofCan improve performance (speed) by reducing number of
table lookups (i.e. table lookups (i.e. reduce number of necessary join queriesreduce number of necessary join queries ))

ļƒ’ (^) Costs (due to data duplication)Costs (due to data duplication)

ļƒ’ Wasted storage spaceWasted storage space
ļƒ’ Data integrity/consistency threatsData integrity/consistency threats

ļƒ’ (^) Common denormalization opportunitiesCommon denormalization opportunities

ļƒ’ One-to-one relationship (Fig. 5-3)One-to-one relationship (Fig. 5-3)
ļƒ’ Many-to-many relationship with non-key attributesMany-to-many relationship with non-key attributes
(associative entity) (Fig. 5-4) (associative entity) (Fig. 5-4)
ļƒ’ Reference data (1:N relationship where 1-side has data notReference data (1:N relationship where 1-side has data not
used in any other relationship) (Fig. 5-5) used in any other relationship) (Fig. 5-5)

Figure 5-3 A possible denormalization situation: two entities with one-

to-one relationship

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

Figure 5-

A possible

denormalization

situation:

reference data

Extra table access required Data duplication

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

Chapter 5 © 2013 Pearson Education, Inc. Publishing as Prentice Hall© 2013 Pearson Education, Inc. Publishing as Prentice Hall

DENORMALIZE WITH DENORMALIZE WITH

CAUTION CAUTION

Denormalization canDenormalization can

ļƒ’

Increase chance of errors and inconsistenciesIncrease chance of errors and inconsistencies

ļƒ’

Reintroduce anomaliesReintroduce anomalies

ļƒ’

Force reprogramming when business rulesForce reprogramming when business rules

change change

Perhaps other methods could be used toPerhaps other methods could be used to

improve performance of joins improve performance of joins

ļƒ’

Organization of tables in the database (fileOrganization of tables in the database (file

organization and clustering) organization and clustering)

ļƒ’

Proper query design and optimizationProper query design and optimization