Chapter 5:

Physical Database Design and

Performance

5-1
Steps in Database Design

Real World

1. Conceptual Database Design Entity-relationship diagram

2. Logical Database Design Relations/Tables

3. Physical Database Design File structures

5-2
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

5-3
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

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

5-5
5-6
5-7
Sarbanes Oxley (SOX) Act Compliance Requirements

5-8
 Physical Design Process
Inputs Decisions
lNormalized relations
lAttribute data types
lVolume estimates
lPhysical record descriptions
lAttribute definitions (doesn’t always match
logical design)
lResponse time expectations
lFile organizations
lData security needs Leads to
lIndexes and database
lBackup/recovery needs
architectures
lIntegrity expectations
lQuery optimization
lDBMS technology used

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

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

Data volumes

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

Access Frequencies
(per hour)

5-12
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

5-13
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

5-14
Designing Fields
Field1 Field2 …..

•Field: smallest unit of application data

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

5-15
Choosing Data Types

5-16
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

5-17
 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
§Referential integrity–range control (and null value
allowances) for foreign-key to primary-key match-ups

Field1 Field2 …..

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

5-18
 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)

Graduation Year Age

Triggers can be used to perform these operations.

5-19
 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
• Many-to-many relationship with non-key attributes (associative entity)
• Reference data (1:N relationship where 1-side has data not used in any
other relationship)

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

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

Extra table
access
required

Duplicate description possible

5-22
Figure 5-5
A possible
denormalization
situation:
reference data

Extra table
access
required

Data duplication

5-23
 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

5-24
 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
5-25
Vertical vs Horizontal Partitioning

5-26
Example of Partitioning

5-27
 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

5-28
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

5-29
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.

5-30
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

5-31
Hard Disk Structure

5-32
Hard Disk Structure

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

5-34
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

5-35
Figure 5-7a
Sequential file
organization

Records of the Sequential

file are stored in storage:
sequence by the Average time to
find desired record
primary key
= log2n
field values.
If this were a
heap,
Average time to
find desired record
= n/2
5-36
 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)

5-37
Library Indexing System

5-38
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
5-39
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

5-40
Figure 5-7c
Hashed file
organization

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

5-41
5-42
 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

5-43
 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)

5-44
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

5-45
 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

5-46
Exercise for Indexing
• Author(AID, Name, Street, City, Country, Email, Mobile, BankAccount …)

• C0-Authored(AID, Tno, SeqNo)

• Textbook(Tno, Title, Abstract, ISBN, Pages, PubDate, …CAID)

• Download(Tno, RID, DLDDateTime, PaidAmount)

• Reader(RID, Name, Street, City, Country, Email, Mobile, …)

5-47
 Summary
• Physical database design:
• Translates the logical description of data into the technical
specifications for storing and retrieving data;
• Its goal is to create a design for storing data that will provide
adequate performance and insure database integrity, security and
recoverability.
• A file organization arranges the records of a file on a
secondary storage device. The three categories are:
1. sequential;
2. indexed; and
3. hashed.

48 5-48