SlideShare a Scribd company logo
1 of 55
WEEK IX PART 1
JOEY MILLER D. MINGUILLAN
 Files
 Databases
 Normalization
 Key design
 Using the database
 Data warehouses
 Data mining
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
2
 The objectives in the design of data storage
organization are
◦ The data must be available when the user wants to
use it
◦ The data must have integrity
 It must be accurate and consistent
◦ Efficient storage of data as well as efficient
updating and retrieval
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
3
 Further design objectives
◦ The information retrieval be purposeful
◦ The information obtained from the stored data
must be in an integrated form to be useful for
 Managing
 Planning
 Controlling
 Decision making
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
4
 There are two approaches to the storage of
data in a computer system
◦ Store the data in individual files each unique to a
particular application
◦ Storage of data in a computer-based system
involves building a database
 A formally defined and centrally controlled store of
data intended for use in many different applications
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
5
 A file can be designed and built quite rapidly,
and the concerns for data availability and
security are minimized
 Analysts can choose an appropriate file
structure according to the required
processing speed of the particular application
system
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
6
 The effectiveness objectives of the database
include
◦ Ensuring that data can be shared among users for a
variety of applications
◦ Maintaining data that are both accurate and
consistent
◦ Ensuring all data required for current and future
applications will be readily available
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
7
 Further effectiveness objectives of the
database include
◦ Allowing the database to evolve and the needs of
the users to grow
◦ Allowing users to construct their personal view of
the data without concern for the way the data are
physically stored
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
8
 The efficiency measures of database design
are
◦ Time and cost required for the design and
development of the database
◦ Cost for operation and maintenance
◦ Cost for the hardware installation
◦ Cost for user training
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
9
 Metadata is the information that describes
data in the file or database
◦ Used to help users understand the form and
structure of the data
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
10
 Entities are objects or events for which data is
collected and stored
 An entity subtype represents data about an
entity that may not be found on every record
 Relationships are associations between
entities
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
11
 A distinct collection of data for one person,
place, thing, or event
 Entities become files of database tables
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
12
Customer
 Associative Entity - links two entities
 An associative entity can only exist between
two entities
 Associative entities become database tables
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
13
Order
Item
 Attributive Entity - describes attributes,
especially repeating elements
 Attributive entities tables, table files or
database code tables
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
14
Book
Subject
 The relationship line between a many-to-
many relationship becomes an associative
entity, sometimes called a composite entity or
gerund
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
15
 Each entity end has a “one” connection
 The associative entity has a “many”
connection on each side
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
16
 The key fields for the associative entity are
◦ The primary key for each “one” end is a foreign key
on the associative entity
◦ Both foreign keys concatenated together become
the primary key
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
17
 Relationships may be
◦ One-to-one
◦ One-to-many
◦ Many-to-many
 A single vertical line represents one
 A circle represents zero or none
 A crows foot represents many
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
18
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
19
Many One
Many NoneO
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
20
 The ordinality is the minimum number that
can occur in a relationship
 If the ordinality is zero, it means that it is
possible to have none of the entity
O OrderItem
 A special one-to-one relationship
 It is used to represent additional attributes,
which may not be present on every record of
the first entity
 This eliminates null fields on the primary
database
 For example, a company that has preferred
customers, or student interns
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
21
Student
Internship
 A self-join is when a record has a
relationship with another record on the
same file
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
22
 Attributes are a characteristic of an entity,
sometimes called a field
 Records are a collection of data items that
have something in common
 Keys are data items in a record used to
identify the record
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
23
 Key types are
◦ Primary key, unique for the record
◦ Secondary key, a key which may not be unique
◦ Concatenated key, a combination of two or more
data items for the key
◦ Foreign key, a data item in one record that is the
key of another record
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
24
 A file contains groups of records used to
provide information for operations, planning,
management, and decision making
 Files can be used for storing data for an
indefinite period of time, or they can be used
to store data temporarily for a specific
purpose
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
25
 Types of files available
◦ Master file
◦ Transaction file
◦ Table file
◦ Work file
◦ Report file
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
26
 Master files
◦ Have large records
◦ Contain all pertinent information about an entity
 Transaction records
◦ Are short records
◦ Contain information used to update master files
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
27
 There are different organizational structures
for file design
◦ Sequential organization
◦ Linked lists
◦ Hashed file organization
◦ Indexed organization
◦ Indexed-sequential organization
◦ VSAM (Virtual Storage Access Method), sequential
and indexed-sequential files
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
28
 A database is intended to be shared by many
users
 There are three structures for storing
database files:
◦ Hierarchical database structures
◦ Network database structures
◦ Relational database structures
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
29
 Normalization is the transformation of
complex user views and data to a set of
smaller, stable, and easily maintainable data
structures
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
30
 Normalization creates data that are stored
only once on a file
 The exception is key fields
 This eliminates redundant data storage
 It provides ideal data storage for database
systems
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
31
 The three steps of data normalization are
◦ Remove all repeating groups and identify the
primary key
◦ Ensure that all nonkey attributes are fully
dependent on the primary key
◦ Remove any transitive dependencies, attributes
which are dependent on other nonkey attributes
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
32
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
33
Unnormalized
Relationship
Normalized
Relations (1NF)
Second Normal Form
Relations (2NF)
Third Normal Form
Relations (1NF)
User View
Remove repeating groups
Remove partial dependencies
Remove transitive dependencies
 Data model diagrams are used to show
relationships between attributes
 An oval represents an attribute
 A single arrow line represents one
 A double arrow line represents many
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
34
Customer
Number
Salesperson
Number
 Remove any repeating groups
 All repeating groups are moved into a new
table
 Foreign keys are used to link the tables
 When a relation contains no repeating
groups, is in the first normal form
 Keys must be included to link the relations,
tables
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
35
 Remove any partial dependencies
 A partial dependency is when the data are
only dependent on a part of a key field
 A relation is created for the data that are only
dependent on part of the key and another for
data that are dependent on both parts
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
36
 Remove any transitive dependencies
 A transitive dependency is when a relation
contains data that are not part of the entity
 The problem with transitive dependencies is
updating the data
 A single data item may be present on many
records
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
37
 The entity-relationship diagram may be
used to determine record keys
◦ When the relationship is one-to-many, the
primary key of the file at the one end of the
relationship should be contained as a foreign
key on the file at the many end of the
relationship
◦ A many-to-many relationship should be divided
into two one-to-many relationships with an
associative entity in the middle
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
38
 Guidelines for creating master files or
database relations are
◦ Each separate entity should have it's own master
file or database relation
◦ A specific, nonkey data field should exist on only
one master file or relation
◦ Each master file or relation should have programs
to create, read, update, and delete records
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
39
 There are three integrity constraints that help
to ensure that the database contains accurate
data:
◦ Entity integrity constraints, which govern the
composition of primary keys
◦ Referential integrity, which governs the denature of
records in a one-to-many relationship
◦ Domain integrity
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
40
 Entity integrity constraints are rules for
primary keys:
◦ The primary key cannot have a null value
◦ If the primary key is a composite key, none of the
fields in the key can contain a null value
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
41
 Referential integrity governs the denature of
records in a one-to-many relationship
 Referential integrity means that all foreign
keys in one table (the child table) must have a
matching record in the parent table
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
42
 Referential integrity includes
◦ You cannot add a record without a matching foreign
key record
◦ You cannot change a primary key that has matching
child table records
 A child table that has a foreign key for a different
record
◦ You cannot delete a record that has child records
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
43
 A restricted database updates or deletes a
key only if there are no matching child
records
 A cascaded database will delete or update all
child records when a parent record is deleted
or changed
 The parent triggers the changes
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
44
 Domain integrity defines rules that ensure
that only valid data are stored on database
records
◦ Domain integrity has two forms:
 Check constraints, which are defined at the table level
 Rules, which are defined as separate objects and may
be used within a number of fields
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
45
 Guidelines to retrieve and present data
◦ Choose a relation from the database
◦ Join two relations together
◦ Project columns from the relation
◦ Select rows from the relation
◦ Derive new attributes
◦ Index or sort rows
◦ Calculate totals and performance measures
◦ Present data
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
46
 Denormalization is the process of taking the
logical data model and transforming it into an
efficient physical model
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
47
 Data warehouses are used to organize
information for quick and effective queries
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
48
 In the data warehouse, data are organized
around major subjects
 Data in the warehouse are stored as
summarized rather than detailed raw data
 Data in the data warehouse cover a much
longer time frame than in a traditional
transaction-oriented database
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
49
 Data warehouses are organized for fast
queries
 Data warehouses are usually optimized for
answering complex queries, known as OLAP
 Data warehouses allow for easy access via
data-mining software called siftware
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
50
 Data warehouses include multiple databases
that have been processed so that data are
uniformly defined, containing what is referred
to as “clean” data
 Data warehouses usually contain data from
outside sources
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
51
◦ Online analytic processing (OLAP) is meant to
answer decision makers’ complex questions by
defining a multidimensional database
◦ Data mining, or knowledge data discovery (KDD), is
the process of identifying patterns that a human is
incapable of detecting
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
52
 Data mining has a number of decision aids
available, including
◦ Statistical analysis
◦ Decision trees
◦ Neural networks
◦ Fuzzy logic
◦ Data visualization
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
53
 Data mining patterns that decision makers try
to identify include
◦ Associations, patterns that occur together
◦ Sequences, patterns of actions that take place over
a period of time
◦ Clustering, patterns that develop among groups of
people
◦ Trends, the patterns that are noticed over a period
of time
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
54
 Web-based databases are used for sharing
data
 Extensible markup language (XML) is used to
define data used primarily for business data
exchange over the Web
◦ An XML document contains only data and the
nature of the data
Kendall & KendallCopyright © 2002 by Prentice Hall, Inc.
17-
55

More Related Content

Viewers also liked

Mba i-ifm-u-3 operating systems
Mba i-ifm-u-3 operating systemsMba i-ifm-u-3 operating systems
Mba i-ifm-u-3 operating systemsRai University
 
Database Key terms Flash Cards
Database Key terms Flash CardsDatabase Key terms Flash Cards
Database Key terms Flash Cardsjog_glister
 
Concept of computer files
Concept of computer filesConcept of computer files
Concept of computer filesSamuel Igbanogu
 
Presentation of DBMS (database management system) part 1
Presentation of DBMS (database management system) part 1Presentation of DBMS (database management system) part 1
Presentation of DBMS (database management system) part 1Junaid Nadeem
 
C1 basic concepts of database
C1 basic concepts of databaseC1 basic concepts of database
C1 basic concepts of databaseWan Azni
 
Slide 5 keys
Slide 5 keysSlide 5 keys
Slide 5 keysVisakh V
 
11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMSkoolkampus
 

Viewers also liked (11)

Chap17
Chap17Chap17
Chap17
 
Mba i-ifm-u-3 operating systems
Mba i-ifm-u-3 operating systemsMba i-ifm-u-3 operating systems
Mba i-ifm-u-3 operating systems
 
Database Key terms Flash Cards
Database Key terms Flash CardsDatabase Key terms Flash Cards
Database Key terms Flash Cards
 
Dbms Useful PPT
Dbms Useful PPTDbms Useful PPT
Dbms Useful PPT
 
Concept of computer files
Concept of computer filesConcept of computer files
Concept of computer files
 
Presentation of DBMS (database management system) part 1
Presentation of DBMS (database management system) part 1Presentation of DBMS (database management system) part 1
Presentation of DBMS (database management system) part 1
 
C1 basic concepts of database
C1 basic concepts of databaseC1 basic concepts of database
C1 basic concepts of database
 
Slide 5 keys
Slide 5 keysSlide 5 keys
Slide 5 keys
 
Dbms mca-section a
Dbms mca-section aDbms mca-section a
Dbms mca-section a
 
11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS11. Storage and File Structure in DBMS
11. Storage and File Structure in DBMS
 
File organization
File organizationFile organization
File organization
 

Similar to Designing database week ix part 1

The Database Environment Chapter 1
The Database Environment Chapter 1The Database Environment Chapter 1
The Database Environment Chapter 1Jeanie Arnoco
 
II-SDV 2012 Merging Information from Structured and Unstructured Information ...
II-SDV 2012 Merging Information from Structured and Unstructured Information ...II-SDV 2012 Merging Information from Structured and Unstructured Information ...
II-SDV 2012 Merging Information from Structured and Unstructured Information ...Dr. Haxel Consult
 
CH10-Managing a Database
CH10-Managing a DatabaseCH10-Managing a Database
CH10-Managing a DatabaseSukanya Ben
 
Database Systems-Lec 1.ppt
Database Systems-Lec 1.pptDatabase Systems-Lec 1.ppt
Database Systems-Lec 1.pptsara591850
 
Ch11-Data Storage Design
Ch11-Data Storage DesignCh11-Data Storage Design
Ch11-Data Storage DesignFajar Baskoro
 
computer fund-database presentation
 computer fund-database presentation computer fund-database presentation
computer fund-database presentationRakibul islam
 
Chapter 10 database management
Chapter 10   database managementChapter 10   database management
Chapter 10 database managementhaider ali
 
The Database Environment Chapter 11
The Database Environment Chapter 11The Database Environment Chapter 11
The Database Environment Chapter 11Jeanie Arnoco
 
DotNetToscana: NoSQL Revolution - RavenDB
DotNetToscana: NoSQL Revolution - RavenDBDotNetToscana: NoSQL Revolution - RavenDB
DotNetToscana: NoSQL Revolution - RavenDBNicola Baldi
 
File systems versus a dbms
File systems versus a dbmsFile systems versus a dbms
File systems versus a dbmsRituBhargava7
 
Data Warehousing
Data WarehousingData Warehousing
Data Warehousingamooool2000
 
Data Modeling Fundamentals
Data Modeling FundamentalsData Modeling Fundamentals
Data Modeling FundamentalsDATAVERSITY
 

Similar to Designing database week ix part 1 (20)

Chap11
Chap11Chap11
Chap11
 
Chap10
Chap10Chap10
Chap10
 
Chap02
Chap02Chap02
Chap02
 
The Database Environment Chapter 1
The Database Environment Chapter 1The Database Environment Chapter 1
The Database Environment Chapter 1
 
Intro_toDB.ppt
Intro_toDB.pptIntro_toDB.ppt
Intro_toDB.ppt
 
II-SDV 2012 Merging Information from Structured and Unstructured Information ...
II-SDV 2012 Merging Information from Structured and Unstructured Information ...II-SDV 2012 Merging Information from Structured and Unstructured Information ...
II-SDV 2012 Merging Information from Structured and Unstructured Information ...
 
CH10-Managing a Database
CH10-Managing a DatabaseCH10-Managing a Database
CH10-Managing a Database
 
Database Systems-Lec 1.ppt
Database Systems-Lec 1.pptDatabase Systems-Lec 1.ppt
Database Systems-Lec 1.ppt
 
Chap01
Chap01Chap01
Chap01
 
Chap21
Chap21Chap21
Chap21
 
Ch11-Data Storage Design
Ch11-Data Storage DesignCh11-Data Storage Design
Ch11-Data Storage Design
 
computer fund-database presentation
 computer fund-database presentation computer fund-database presentation
computer fund-database presentation
 
Chap01
Chap01Chap01
Chap01
 
DWH Concepts
DWH ConceptsDWH Concepts
DWH Concepts
 
Chapter 10 database management
Chapter 10   database managementChapter 10   database management
Chapter 10 database management
 
The Database Environment Chapter 11
The Database Environment Chapter 11The Database Environment Chapter 11
The Database Environment Chapter 11
 
DotNetToscana: NoSQL Revolution - RavenDB
DotNetToscana: NoSQL Revolution - RavenDBDotNetToscana: NoSQL Revolution - RavenDB
DotNetToscana: NoSQL Revolution - RavenDB
 
File systems versus a dbms
File systems versus a dbmsFile systems versus a dbms
File systems versus a dbms
 
Data Warehousing
Data WarehousingData Warehousing
Data Warehousing
 
Data Modeling Fundamentals
Data Modeling FundamentalsData Modeling Fundamentals
Data Modeling Fundamentals
 

Designing database week ix part 1

  • 1. WEEK IX PART 1 JOEY MILLER D. MINGUILLAN
  • 2.  Files  Databases  Normalization  Key design  Using the database  Data warehouses  Data mining Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 2
  • 3.  The objectives in the design of data storage organization are ◦ The data must be available when the user wants to use it ◦ The data must have integrity  It must be accurate and consistent ◦ Efficient storage of data as well as efficient updating and retrieval Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 3
  • 4.  Further design objectives ◦ The information retrieval be purposeful ◦ The information obtained from the stored data must be in an integrated form to be useful for  Managing  Planning  Controlling  Decision making Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 4
  • 5.  There are two approaches to the storage of data in a computer system ◦ Store the data in individual files each unique to a particular application ◦ Storage of data in a computer-based system involves building a database  A formally defined and centrally controlled store of data intended for use in many different applications Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 5
  • 6.  A file can be designed and built quite rapidly, and the concerns for data availability and security are minimized  Analysts can choose an appropriate file structure according to the required processing speed of the particular application system Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 6
  • 7.  The effectiveness objectives of the database include ◦ Ensuring that data can be shared among users for a variety of applications ◦ Maintaining data that are both accurate and consistent ◦ Ensuring all data required for current and future applications will be readily available Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 7
  • 8.  Further effectiveness objectives of the database include ◦ Allowing the database to evolve and the needs of the users to grow ◦ Allowing users to construct their personal view of the data without concern for the way the data are physically stored Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 8
  • 9.  The efficiency measures of database design are ◦ Time and cost required for the design and development of the database ◦ Cost for operation and maintenance ◦ Cost for the hardware installation ◦ Cost for user training Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 9
  • 10.  Metadata is the information that describes data in the file or database ◦ Used to help users understand the form and structure of the data Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 10
  • 11.  Entities are objects or events for which data is collected and stored  An entity subtype represents data about an entity that may not be found on every record  Relationships are associations between entities Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 11
  • 12.  A distinct collection of data for one person, place, thing, or event  Entities become files of database tables Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 12 Customer
  • 13.  Associative Entity - links two entities  An associative entity can only exist between two entities  Associative entities become database tables Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 13 Order Item
  • 14.  Attributive Entity - describes attributes, especially repeating elements  Attributive entities tables, table files or database code tables Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 14 Book Subject
  • 15.  The relationship line between a many-to- many relationship becomes an associative entity, sometimes called a composite entity or gerund Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 15
  • 16.  Each entity end has a “one” connection  The associative entity has a “many” connection on each side Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 16
  • 17.  The key fields for the associative entity are ◦ The primary key for each “one” end is a foreign key on the associative entity ◦ Both foreign keys concatenated together become the primary key Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 17
  • 18.  Relationships may be ◦ One-to-one ◦ One-to-many ◦ Many-to-many  A single vertical line represents one  A circle represents zero or none  A crows foot represents many Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 18
  • 19. Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 19 Many One Many NoneO
  • 20. Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 20  The ordinality is the minimum number that can occur in a relationship  If the ordinality is zero, it means that it is possible to have none of the entity O OrderItem
  • 21.  A special one-to-one relationship  It is used to represent additional attributes, which may not be present on every record of the first entity  This eliminates null fields on the primary database  For example, a company that has preferred customers, or student interns Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 21 Student Internship
  • 22.  A self-join is when a record has a relationship with another record on the same file Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 22
  • 23.  Attributes are a characteristic of an entity, sometimes called a field  Records are a collection of data items that have something in common  Keys are data items in a record used to identify the record Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 23
  • 24.  Key types are ◦ Primary key, unique for the record ◦ Secondary key, a key which may not be unique ◦ Concatenated key, a combination of two or more data items for the key ◦ Foreign key, a data item in one record that is the key of another record Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 24
  • 25.  A file contains groups of records used to provide information for operations, planning, management, and decision making  Files can be used for storing data for an indefinite period of time, or they can be used to store data temporarily for a specific purpose Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 25
  • 26.  Types of files available ◦ Master file ◦ Transaction file ◦ Table file ◦ Work file ◦ Report file Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 26
  • 27.  Master files ◦ Have large records ◦ Contain all pertinent information about an entity  Transaction records ◦ Are short records ◦ Contain information used to update master files Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 27
  • 28.  There are different organizational structures for file design ◦ Sequential organization ◦ Linked lists ◦ Hashed file organization ◦ Indexed organization ◦ Indexed-sequential organization ◦ VSAM (Virtual Storage Access Method), sequential and indexed-sequential files Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 28
  • 29.  A database is intended to be shared by many users  There are three structures for storing database files: ◦ Hierarchical database structures ◦ Network database structures ◦ Relational database structures Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 29
  • 30.  Normalization is the transformation of complex user views and data to a set of smaller, stable, and easily maintainable data structures Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 30
  • 31.  Normalization creates data that are stored only once on a file  The exception is key fields  This eliminates redundant data storage  It provides ideal data storage for database systems Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 31
  • 32.  The three steps of data normalization are ◦ Remove all repeating groups and identify the primary key ◦ Ensure that all nonkey attributes are fully dependent on the primary key ◦ Remove any transitive dependencies, attributes which are dependent on other nonkey attributes Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 32
  • 33. Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 33 Unnormalized Relationship Normalized Relations (1NF) Second Normal Form Relations (2NF) Third Normal Form Relations (1NF) User View Remove repeating groups Remove partial dependencies Remove transitive dependencies
  • 34.  Data model diagrams are used to show relationships between attributes  An oval represents an attribute  A single arrow line represents one  A double arrow line represents many Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 34 Customer Number Salesperson Number
  • 35.  Remove any repeating groups  All repeating groups are moved into a new table  Foreign keys are used to link the tables  When a relation contains no repeating groups, is in the first normal form  Keys must be included to link the relations, tables Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 35
  • 36.  Remove any partial dependencies  A partial dependency is when the data are only dependent on a part of a key field  A relation is created for the data that are only dependent on part of the key and another for data that are dependent on both parts Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 36
  • 37.  Remove any transitive dependencies  A transitive dependency is when a relation contains data that are not part of the entity  The problem with transitive dependencies is updating the data  A single data item may be present on many records Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 37
  • 38.  The entity-relationship diagram may be used to determine record keys ◦ When the relationship is one-to-many, the primary key of the file at the one end of the relationship should be contained as a foreign key on the file at the many end of the relationship ◦ A many-to-many relationship should be divided into two one-to-many relationships with an associative entity in the middle Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 38
  • 39.  Guidelines for creating master files or database relations are ◦ Each separate entity should have it's own master file or database relation ◦ A specific, nonkey data field should exist on only one master file or relation ◦ Each master file or relation should have programs to create, read, update, and delete records Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 39
  • 40.  There are three integrity constraints that help to ensure that the database contains accurate data: ◦ Entity integrity constraints, which govern the composition of primary keys ◦ Referential integrity, which governs the denature of records in a one-to-many relationship ◦ Domain integrity Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 40
  • 41.  Entity integrity constraints are rules for primary keys: ◦ The primary key cannot have a null value ◦ If the primary key is a composite key, none of the fields in the key can contain a null value Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 41
  • 42.  Referential integrity governs the denature of records in a one-to-many relationship  Referential integrity means that all foreign keys in one table (the child table) must have a matching record in the parent table Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 42
  • 43.  Referential integrity includes ◦ You cannot add a record without a matching foreign key record ◦ You cannot change a primary key that has matching child table records  A child table that has a foreign key for a different record ◦ You cannot delete a record that has child records Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 43
  • 44.  A restricted database updates or deletes a key only if there are no matching child records  A cascaded database will delete or update all child records when a parent record is deleted or changed  The parent triggers the changes Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 44
  • 45.  Domain integrity defines rules that ensure that only valid data are stored on database records ◦ Domain integrity has two forms:  Check constraints, which are defined at the table level  Rules, which are defined as separate objects and may be used within a number of fields Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 45
  • 46.  Guidelines to retrieve and present data ◦ Choose a relation from the database ◦ Join two relations together ◦ Project columns from the relation ◦ Select rows from the relation ◦ Derive new attributes ◦ Index or sort rows ◦ Calculate totals and performance measures ◦ Present data Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 46
  • 47.  Denormalization is the process of taking the logical data model and transforming it into an efficient physical model Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 47
  • 48.  Data warehouses are used to organize information for quick and effective queries Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 48
  • 49.  In the data warehouse, data are organized around major subjects  Data in the warehouse are stored as summarized rather than detailed raw data  Data in the data warehouse cover a much longer time frame than in a traditional transaction-oriented database Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 49
  • 50.  Data warehouses are organized for fast queries  Data warehouses are usually optimized for answering complex queries, known as OLAP  Data warehouses allow for easy access via data-mining software called siftware Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 50
  • 51.  Data warehouses include multiple databases that have been processed so that data are uniformly defined, containing what is referred to as “clean” data  Data warehouses usually contain data from outside sources Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 51
  • 52. ◦ Online analytic processing (OLAP) is meant to answer decision makers’ complex questions by defining a multidimensional database ◦ Data mining, or knowledge data discovery (KDD), is the process of identifying patterns that a human is incapable of detecting Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 52
  • 53.  Data mining has a number of decision aids available, including ◦ Statistical analysis ◦ Decision trees ◦ Neural networks ◦ Fuzzy logic ◦ Data visualization Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 53
  • 54.  Data mining patterns that decision makers try to identify include ◦ Associations, patterns that occur together ◦ Sequences, patterns of actions that take place over a period of time ◦ Clustering, patterns that develop among groups of people ◦ Trends, the patterns that are noticed over a period of time Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 54
  • 55.  Web-based databases are used for sharing data  Extensible markup language (XML) is used to define data used primarily for business data exchange over the Web ◦ An XML document contains only data and the nature of the data Kendall & KendallCopyright © 2002 by Prentice Hall, Inc. 17- 55