Jeffrey A. Hoffer, Mary B. Prescott, Fred R. Mcfadden: Modern Database Management 8 Edition
Jeffrey A. Hoffer, Mary B. Prescott, Fred R. Mcfadden: Modern Database Management 8 Edition
Objectives
Definition of 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 6
Chapter 6
relations
Decisions
Attribute data types
estimates
expectations
Leads to File
security needs
Indexes and
technology used
Query optimization
Chapter 6
Attribute definitions
Chapter 6
Figure 6-1 Composite usage map (Pine Valley Furniture Company) (cont.)
Data volumes
2007 by Prentice Hall FAROOQ
Chapter 6
Figure 6-1 Composite usage map (Pine Valley Furniture Company) (cont.)
Chapter 6
Figure 6-1 Composite usage map (Pine Valley Furniture Company) (cont.) Usage analysis:
140 purchased parts accessed per hour 80 quotations accessed from these 140 purchased part accesses 70 suppliers accessed from these 80 quotation accesses
Chapter 6
Figure 6-1 Composite usage map (Pine Valley Furniture Company) (cont.) Usage analysis:
75 suppliers accessed per hour 40 quotations accessed from these 75 supplier accesses 40 purchased parts accessed from these 40 quotation accesses
Chapter 6
Designing Fields
Field: smallest unit of data in database Field design
Choosing data type Coding, compression, encryption Controlling data integrity
Chapter 6
10
11
Figure 6-2 Example code look-up table (Pine Valley Furniture Company)
Code saves space, but costs an additional lookup to obtain actual value
Chapter 6
12
Chapter 6
13
Chapter 6
Physical Records
Physical Record: A group of fields stored in adjacent memory locations and retrieved together as a unit Page: The amount of data read or written in one I/O operation Blocking Factor: The number of physical records per page
Chapter 6
15
Denormalization
Transforming normalized relations into unnormalized physical record specifications Benefits: Costs (due to data duplication)
Wasted storage space Data integrity/consistency threats
2007 by Prentice Hall FAROOQ
Can improve performance (speed) by reducing number of table lookups (i.e. reduce number of necessary join queries)
16
Figure 6-3 A possible denormalization situation: two entities with oneto-one relationship
Chapter 6
17
Chapter 6
18
Figure 6-5
A possible denormalization situation: reference data
Data duplication 19
Chapter 6
Partitioning
Horizontal Partitioning: Distributing the rows of a table into several separate files
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 table into several separate relations
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 Partitions often correspond with User Schemas (user views)
Chapter 6
20
Partitioning (cont.)
Advantages of Partitioning:
Efficiency: Records used together are grouped together Local optimization: Each partition can be optimized for performance Security, recovery Load balancing: Partitions stored on different disks, reduces contention Take advantage of parallel processing capability
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 6
21
Data Replication
Purposely storing the same data in multiple locations of the database Improves performance by allowing multiple users to access the same data at the same time with minimum contention Sacrifices data integrity due to data duplication Best for data that is not updated often
Chapter 6
22
Chapter 6
23
Chapter 6
24
File Organizations
Technique for physically arranging records of a file on secondary storage Factors for selecting file organization:
2007 by Prentice Hall FAROOQ
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
25
1
2
If not sorted
Average time to find desired record = n/2
n
Chapter 6
Records of the file are stored in sequence by the primary key field values
If sorted
26
Chapter 6
27
Chapter 6
Leaves of the tree are all at same level consistent access time
Usually uses divisionremainder to determine record position. Records with same position are grouped in lists
Chapter 6
Hash algorithm
29
Chapter 6
30
Chapter 6
31
Chapter 6
32
2007 by Prentice Hall FAROOQ
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 6
33
Chapter 6
Use on larger tables Index the primary key of each table Index search fields (fields frequently in WHERE clause) Fields in SQL ORDER BY and GROUP BY commands When there are >100 values but not when there are <30 values
34
Chapter 6
35
RAID
Redundant Array of Inexpensive Disks A set of disk drives that appear to the user to be a single disk drive Allows parallel access to data (improves access speed) Pages are arranged in stripes
Chapter 6
36
Chapter 6
37
Raid 3
Error correction in one disk Record spans multiple data disks (more than RAID2) Not good for multi-user environments,
Raid 1
Redundant data fault tolerant Most common form
Raid 2
No redundancy One record spans across data disks Error correction in multiple disks reconstruct damaged data
Error correction in one disk Multiple records per stripe Parallelism, but slow updates due to error correction contention
Raid 5
Rotating parity array Error correction takes place in same disks as data storage Parallelism, better performance than 38 Raid4
Chapter 6
Raid 4
Database Architectures
(Figure 6-11)
Current Technology
2007 by Prentice Hall FAROOQ