CHAPTER 5:

PHYSICAL DATABASE DESIGN AND PERFORMANCE

Modern Database Management

12th Edition
Global Edition

Jeff Hoffer, Ramesh Venkataraman,

Heikki Topi

Copyright © 2016 Pearson Education, Ltd.

OBJECTIVES
Define terms
Describe the physical database design process
Choose storage formats for attributes
Select appropriate file organizations
Describe three types of file organization
Describe indexes and their appropriate use
Translate a database model into efficient structures
Know when and how to use denormalization

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-2

 PHYSICAL DATABASE DESIGN

Purpose–translate the logical description of data into the technical specifications for
storing and retrieving data
Goal–create a design for storing data that will provide adequate performance and ensure
database integrity, security, and recoverability
3 dạng thức chuẩn hóa :
●không có thuộc tính đa giá trị
●không có phụ thuộc đầy đủ
●không có phụ thuộc bắc cầu

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-3

 PHYSICAL DESIGN PROCESS
Inputs Decision
●Normalized relations: s data types
●Attribute
●Volume estimates
●Physical record descriptions
●Attribute definitions (doesn’t always match
●Response time logical design)
expectations
●File organizations
●Data security needs Leads to
●Indexes and database
●Backup/recovery needs architectures
●Integrity expectations ●Query optimization
●DBMS technology used

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-4

 PHYSICAL DESIGN FOR
REGULATORY COMPLIANCE
Sarbanes- Oxley Act (SOX) – protect investors
by improving accuracy and reliability
Committee of Sponsoring Organizations (COSO)
of the Treadway Commission
IT Infrastructure Library (ITIL)
Control Objectives for Information and Related
Technology (COBIT)
Regulations and standards that impact physical design decisions

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-5

 Figure 5-1 Composite usage map
(Pine Valley Furniture Company)

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-6

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

Data
volumes

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-7

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

Access Frequencies
(per hour)

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-8

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

Usage analysis:
14,000 purchased parts
accessed per hour 🡺
8000 supplies accessed from
these 14,000 purchased part
accesses 🡺
7000 suppliers accessed from
these 8000 supplies accesses

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-9

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

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-10

DESIGNING FIELDS

Field: smallest unit of application data

recognized by system software
Field design
Choosing data type
Coding, compression, encryption
Controlling data integrity

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-11

CHOOSING DATA TYPES

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-12

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 Copyright © 2016 Pearson Education, Ltd. 5-13

FIELD DATA INTEGRITY
Default value–assumed value if no explicit value
Range control–allowable value limitations (constraints or validation rules)
Null value control–allowing or prohibiting empty fields: cho phép cột nhập
giá trị null thì khi ngta ko nhập dữ liệu thì tiết kiệm được khoảng trống
Referential integrity–range control (and null value allowances) for foreign-
key to primary-key match-ups: ràng buộc giữa khóa chính và khóa ngoài

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

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-14
HANDLING MISSING DATA

Substitute an estimate of the missing

value (e.g., using a formula)
Construct a report listing missing values
In programs, ignore missing data unless
the value is significant (sensitivity testing)

Triggers can be used to perform these operations.

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-15
 DENORMALIZATION
Transforming normalized relations into non-normalized
physical record specifications
Benefits:
Can improve performance (speed) by reducing number of table lookups
(i.e. reduce number of necessary join queries)
Costs (due to data duplication)
Wasted storage space
Data integrity/consistency threats
Common denormalization opportunities
One-to-one relationship (Fig. 5-3)
Many-to-many relationship with non-key attributes (associative entity)
(Fig. 5-4)
Reference data (1:N relationship where 1-side has data not used in any
other relationship) (Fig. 5-5)

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-16

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

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-17

Figure 5-4 A possible denormalization situation: a many-to-many
relationship with nonkey attributes

Extra table
access
required

Duplicate description possible

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-18

Figure 5-5
A possible
denormalization
situation:
reference data

Extra table
access
required

Data duplication

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-19

 DENORMALIZE WITH CAUTION
Denormalization can
Increase chance of errors and inconsistencies
Reintroduce anomalies
Force reprogramming when business rules
change
Perhaps other methods could be used to
improve performance of joins
Organization of tables in the database (file
organization and clustering)
Proper query design and optimization

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-20

 PARTITIONING
Horizontal Partitioning: Distributing the rows of a
logical relation into several separate tables
Useful for situations where different users need access to
different rows
Three types: Key Range Partitioning, Hash Partitioning, or
Composite Partitioning
Vertical Partitioning: Distributing the columns of a
logical relation into several separate physical tables
Useful for situations where different users need access to
different columns
The primary key must be repeated in each file
Combinations of Horizontal and Vertical
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-21
PARTITIONING PROS AND CONS
Advantages of Partitioning:
Efficiency: Records used together are grouped together
Local optimization: Each partition can be optimized for
performance
Security: data not relevant to users are segregated
Recovery and uptime: smaller files take less time to back up
Load balancing: Partitions stored on different disks, reduces
contention
Disadvantages of Partitioning:
Inconsistent access speed: Slow retrievals across partitions
Complexity: Non-transparent partitioning
Extra space or update time: Duplicate data; access from
multiple partitions

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-22

ORACLE’S HORIZONTAL
PARTITIONING
Range partitioning
Partitions defined by range of field values
Could result in unbalanced distribution of rows
Like-valued fields share partitions
Hash partitioning
Partitions defined via hash functions
Will guarantee balanced distribution of rows
Partition could contain widely varying valued fields
List partitioning
Based on predefined lists of values for the partitioning key
Composite partitioning
Combination of the other approaches

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-23

VERTICAL PARTITIONING

Distribution of the columns of a logical relation

into several separate physical tables.
Example:
One PART table involving accounting, engineering,
and sales attributes.
Split into three, each with the same Product ID, one
for each user group.
This reduces demand on individual relations.
When combinations of data are required, perform join
queries for all needed relations.
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-24
DESIGNING PHYSICAL DATABASE
FILES
Physical File:
A named portion of secondary memory allocated for
the purpose of storing physical records
Tablespace–named logical storage unit in which
data from multiple tables/views/objects can be
stored
Tablespace components
Segment – a table, index, or partition
Extent–contiguous section of disk space
Data block – smallest unit of storage

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-25

 Figure 5-6 DBMS terminology in an Oracle 12c environment

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-26

FILE ORGANIZATIONS
Technique for physically arranging records of a file on
secondary storage
Factors for selecting file organization:
Fast data retrieval and throughput
Efficient storage space utilization
Protection from failure and data loss
Minimizing need for reorganization
Accommodating growth
Security from unauthorized use
Types of file organizations
Heap – no particular order
Sequential
Indexed
Hashed
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-27
Figure 5-7a
Sequential file
organization

Records of the Sequential

file are stored storage:
in sequence by Average time to
find desired record
the primary key
= log2n
field values.
If this were a
heap,
Average time to
find desired record
= n/2
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-28
 INDEXED FILE ORGANIZATIONS
Storage of records sequentially or
nonsequentially with an index that allows
software to locate individual records
Index: a table or other data structure used to
determine in a file the location of records that
satisfy some condition
Primary keys are automatically indexed
Other fields or combinations of fields can also
be indexed; these are called secondary keys (or
nonunique keys)
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-29
 Figure 5-7b Indexed file organization

uses a tree search

Average time to find desired
record based on depth of the
tree and length of the list
Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-30
Figure 5-8 Join Indexes – to speed up join operations

b) Join index for matching foreign

key (FK) and primary key (PK)

a) Join index
for common
non-key
columns

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-31

Figure 5-7c
Hashed file
organization

Hash algorithm
Usually uses division-
remainder to determine
record position. Records
with same position are
grouped in lists.

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-32

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-33
CLUSTERING FILES
In some relational DBMSs, related records from
different tables can be stored together in the same
disk area
Useful for improving performance of join
operations
Primary key records of the main table are stored
adjacent to associated foreign key records of the
dependent table
e.g. Oracle has a CREATE CLUSTER command

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-34

UNIQUE AND NONUNIQUE INDEXES

Unique (primary) Index

Typically done for primary keys, but could also apply
to other unique fields

Nonunique (secondary) index

Done for fields that are often used to group individual
entities (e.g. zip code, product category)

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-35

RULES FOR USING INDEXES

1. Use on larger tables

2. Index the primary key of each table
3. Index search fields (fields frequently in
WHERE clause)
4. Fields in SQL ORDER BY and GROUP BY
commands
5. When there are >100 values but not when there
are <30 values

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-36

 RULES FOR USING INDEXES (CONT.)

6. Avoid use of indexes for fields with long values;

perhaps compress values first
7. If key to index is used to determine location of
record, use surrogate (like sequence number) to
allow even spread in storage area
8. DBMS may have limit on number of indexes per
table and number of bytes per indexed field(s)
9. Be careful of indexing attributes with null
values; many DBMSs will not recognize null
values in an index search

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-37

QUERY OPTIMIZATION
Parallel query processing–possible when
working in multiprocessor systems
Overriding automatic query optimization–
allows for query writers to preempt the
automated optimization
Oracle example:

/* */ clause is a hint to override Oracle’s default query

plan

Chapter 5 Copyright © 2016 Pearson Education, Ltd. 5-38