c h a p t e r

7
MANAGING
DATA
RESOURCES

7.1 © 2002 by Prentice Hall

 LEARNING OBJECTIVES
• COMPARE TRADITIONAL FILE
ORGANIZATION & MANAGEMENT
TECHNIQUES
• DESCRIBE HOW DATABASE
MANAGEMENT SYSTEM
ORGANIZES INFORMATION
*

7.2 © 2002 by Prentice Hall

 LEARNING OBJECTIVES
• IDENTIFY TYPES OF DATABASE,
PRINCIPLES OF DATABASE DESIGN
• DISCUSS DATABASE TRENDS
*

7.3 © 2002 by Prentice Hall

 MANAGEMENT CHALLENGES

• TRADITIONAL DATA FILE

ENVIRONMENT
• DATABASE APPROACH TO DATA
MANAGEMENT
• CREATING DATABASE ENVIRONMENT
• DATABASE TRENDS
*

7.4 © 2002 by Prentice Hall

 MANAGEMENT CHALLENGES

1. ORGANIZATIONAL OBSTACLES:
Challenges existing power structure,
requires organizational restructure
2. COST / BENEFIT CONSIDERATIONS:
Large initial costs, delayed benefits,
tangible, intangible
*

7.5 © 2002 by Prentice Hall

 FILE ORGANIZATION
• BIT: Binary Digit (0,1; Y,N; On,Off)
• BYTE: Combination of BITS which
represent a CHARACTER
• FIELD: Collection of BYTES which
represent a DATUM or Fact
• RECORD: Collection of FIELDS which
reflect a TRANSACTION
*
7.6 © 2002 by Prentice Hall
 FILE ORGANIZATION

• FILE: A Collection of similar

RECORDS
• DATABASE: An Organization’s
Electronic Library of FILES
organized to serve business
applications
*

7.7 © 2002 by Prentice Hall

 FILE ORGANIZATION

• ENTITY: Person, place, thing, event

about which data must be kept
• ATTRIBUTE: Description of a
particular ENTITY
• KEY FIELD: Field used to retrieve,
update, sort RECORD
*

7.8 © 2002 by Prentice Hall

 KEY FIELD

Field in Each Record

Uniquely Identifies THIS Record
For RETRIEVAL
UPDATING
SORTING
*
7.9 © 2002 by Prentice Hall
 PROBLEMS WITH TRADITIONAL FILE
ENVIRONMENT

• DATA REDUNDANCY
• PROGRAM / DATA DEPENDENCY
• LACK OF FLEXIBILITY
• POOR SECURITY
• LACK OF DATA Flat File
SHARING &
AVAILABILITY
*

7.10 © 2002 by Prentice Hall

 SEQUENTIAL VS. DIRECT
FILE ORGANIZATION

• SEQUENTIAL: Tape oriented; one file

follows another; follows physical
sequence
• DIRECT: Disk oriented; can be
accessed without regard to physical
sequence
*

7.11 © 2002 by Prentice Hall

 FILING METHODS
• INDEXED SEQUENTIAL ACCESS METHOD (ISAM) :
– EACH RECORD IDENTIFIED BY KEY
– GROUPED IN BLOCKS AND CYLINDERS
– KEYS IN INDEX
• VIRTUAL STORAGE ACCESS METHOD (VSAM) :
– MEMORY DIVIDED INTO AREAS & INTERVALS
– DYNAMIC FILE SPACE
VSAM WIDELY USED FOR RELATIONAL DATABASES
• DIRECT FILE ACCESS METHOD
*

7.12 © 2002 by Prentice Hall

 DIRECT FILE ACCESS METHOD

• EACH RECORD HAS KEY FIELD

• KEY FIELD FED INTO TRANSFORM
ALGORITHM
• ALGORITHM GENERATES
PHYSICAL STORAGE LOCATION OF
RECORD (RECORD ADDRESS)
*

7.13 © 2002 by Prentice Hall

 DATABASE MANAGEMENT SYSTEM (DBMS)

SOFTWARE TO CREATE & MAINTAIN

DATA
ENABLES BUSINESS APPLICATIONS
TO EXTRACT DATA
INDEPENDENT OF SPECIFIC
COMPUTER PROGRAMS
*
DBM
7.14 © 2002 by Prentice Hall
 COMPONENTS OF DBMS:
• DATA DEFINITION LANGUAGE:
– Defines data elements in database
• DATA MANIPULATION LANGUAGE:
– Manipulates data for applications
• DATA DICTIONARY:
– Formal definitions of all variables in database,
controls variety of database contents, data
elements
*
DBM
7.15 © 2002 by Prentice Hall
 STRUCTURED QUERY LANGUAGE (SQL)

EMERGING STANDARD
DATA MANIPULATION LANGUAGE
FOR RELATIONAL DATABASES
*

DBM
7.16 © 2002 by Prentice Hall
 ELEMENTS OF SQL
• SELECT: List of columns from tables
desired
• FROM: Identifies tables from which
columns will be selected
• WHERE: Includes conditions for
selecting specific rows, conditions for
joining multiple tables
*
DBM
7.17 © 2002 by Prentice Hall
 TWO VIEWS OF DATA

• PHYSICAL VIEW: Where is data physically?

– DRIVE, DISK, SURFACE, TRACK, SECTOR
(BLOCK), RECORD
– TAPE, BLOCK, RECORD NUMBER (KEY)
• LOGICAL VIEW: What data is needed by
application?
– SUCCESSION OF FACTS NEEDED BY
APPLICATION
– NAME, TYPE, LENGTH OF FIELD

*
DBM
7.18 © 2002 by Prentice Hall
 RELATIONAL DATA MODEL
• DATA IN TABLE FORMAT
• RELATION: TABLE
• TUPLE: ROW (RECORD) IN TABLE
• FIELD: COLUMN (ATTRIBUTE) IN TABLE
*
HOURS RATE TOTAL
ABLE $ 40.50 $ 10.35 $ 419.18
BAXTER $ 38.00 $ 8.75 $ 332.50
CHEN $ 42.70 $ 9.25 $ 394.98
DENVER $ 35.90 $ 9.50 $ 341.05
7.19 © 2002 by Prentice Hall
 TYPES OR RELATIONS

ONE-TO-ONE: STUDENT ID

CLASS
ONE-TO-MANY:
STUDENT STUDENT STUDENT
A B C
CLASS CLASS
MANY-TO-MANY:
1 2

STUDENT STUDENT STUDENT

A B C
7.20 © 2002 by Prentice Hall
 HIERARCHICAL DATA MODEL

ROOT Employer

FIRST Compensation Job Benefits

CHILD Assignments

2nd
Ratings Salary Pension Insurance Health
CHILD

7.21 © 2002 by Prentice Hall

 NETWORK DATA MODEL

• VARIATION OF HIERARCHICAL
MODEL
• USEFUL FOR MANY-TO-MANY
RELATIONSHIPS
*
NETWORK NETWORK
1 2

NETWORK NETWORK NETWORK

A B C
7.22 © 2002 by Prentice Hall
 OTHER SYSTEMS

• LEGACY SYSTEM: older system

• OBJECT - ORIENTED DBMS: stores
data & procedures as objects
• OBJECT - RELATIONAL DBMS:
hybrid
*

7.23 © 2002 by Prentice Hall

 CREATING A DATABASE

• CONCEPTUAL DESIGN
• PHYSICAL DESIGN
*

7.24 © 2002 by Prentice Hall

 CREATING A DATABASE
CONCEPTUAL DESIGN:

• ABSTRACT MODEL, BUSINESS

PERSPECTIVE
• HOW WILL DATA BE GROUPED?
• RELATIONSHIPS AMONG ELEMENTS
• ESTABLISH END-USER NEEDS
*

7.25 © 2002 by Prentice Hall

 CREATING A DATABASE
PHYSICAL DESIGN:

• DETAILED MODEL BY DATABASE

SPECIALISTS
• ENTITY-RELATIONSHIP DIAGRAM
• NORMALIZATION
• HARDWARE / SOFTWARE
SPECIFIC
*

7.26 © 2002 by Prentice Hall

 ELEMENTS OF DATABASE
ENVIRONMENT

DATA DATABASE
ADMINISTRATION TECHNOLOGY &
MANAGEMENT

DATABASE
MANAGEMENT
SYSTEM

DATA
PLANNING &
MODELING USERS
METHODOLOGY

7.27 © 2002 by Prentice Hall

 ENTITY- RELATIONSHIP DIAGRAM

ORDER ORDER: #, DATE, PART #, QUANTITY

CAN
HAVE

1
PART: #, DESCRIPTION, UNIT PRICE,
PART
SUPPLIER #

CAN
HAVE
1

SUPPLIER SUPPLIER: #, NAME,

7.28 ADDRESS © 2002 by Prentice Hall
 NORMALIZATION
PROCESS OF CREATING SMALL DATA
STRUCTURES FROM COMPLEX
GROUPS OF DATA
EXAMPLES:
• ACCOUNTS RECEIVABLE
• PERSONNEL RECORDS
• PAYROLL
*

7.29 © 2002 by Prentice Hall

 DISTRIBUTED DATABASES

• PARTITIONED: remote CPUs

(connected to host) have files unique
to that site, e.g., records on local
customers
• DUPLICATE: each remote CPU has
copies of common files, e.g., layouts
for standard reports and forms
*

7.30 © 2002 by Prentice Hall

 DATABASE ADMINISTRATION

• DEFINES & ORGANIZES DATABASE

STRUCTURE AND CONTENT
• DEVELOPS SECURITY PROCEDURES
• DEVELOPS DATABASE DOCUMENTATION
• MAINTAINS DBMS
*

7.31 © 2002 by Prentice Hall

 DATABASE TRENDS
• MULTIDIMENSIONAL DATA ANALYSIS:
3D (or higher) groupings to store
complex data
• HYPERMEDIA: Nodes contain text,
graphics, sound, video, programs.
organizes data as nodes.

7.32 © 2002 by Prentice Hall

 DATABASE TRENDS
• DATA WAREHOUSE: Organization’s
electronic library stores consolidated
current & historic data for
management reporting & analysis
• ON-LINE ANALYTICAL PROCESSING
(OLAP): Tools for multi-
dimensional data analysis
*

7.33 © 2002 by Prentice Hall

 COMPONENTS OF DATA WAREHOUSE

OPERATIONAL,
HISTORICAL DATA
DATA WAREHOUSE

EXTRACT, DATA
INTERNAL TRANSFORM ACCESS &
ANALYSIS
DATA
SOURCES
QUERIES &
REPORTS
INFORMATION
DIRECTORY OLAP
DATA MINING
EXTERNAL
DATA
SOURCES

7.34 © 2002 by Prentice Hall

 DATABASE TRENDS
• DATA MART: Small data warehouse
for special function, e.g., Focused
marketing based on customer
info
• DATAMINING: Tools for finding
hidden patterns, relation- ships, for
predicting trends
*

7.35 © 2002 by Prentice Hall

 DATABASE TRENDS
LINKING DATABASES TO THE WEB:
• WEB USER CONNECTS TO VENDOR
DATABASE
• SPECIAL SOFTWARE CONVERTS HTML
TO SQL
• SQL FINDS DATA, SERVER CONVERTS
RESULT TO HTML
*
7.36 © 2002 by Prentice Hall
 c h a p t e r

7
MANAGING
DATA
RESOURCES

7.37 © 2002 by Prentice Hall