Data Management Concepts: 2013 Pearson Education, Inc. Publishing As Prentice Hall, AIS, 11/e, by Bodnar/Hopwood

Data Management Concepts
Chapter 13
13– 1
 2013 Pearson Education, Inc. Publishing as Prentice Hall, AIS, 11/e, by Bodnar/Hopwood
Learning Objective 1
Define the basic terms used in

database terminology.
13 – 2
Databases
 A database is a structured collection of data
stored in a computer system or network.
 The data in a database are manipulated and
retrieved using database software.
 A database together with related database
software is called a database management
system (DBMS).
13– 3
Databases
 Databases are frequently connected to
eBusiness software at the “back end.”
 DBMS is separate from eBusiness software
product.
 Database agnostic – software can
function with any DBMS.
 SAP is database agnostic
13– 4
Database Agnosticism
 Permits upgrading or modifying the eBusiness
application without having to reorganize,
restructure, or otherwise modify the data or
database software
 Permits multiple applications to share the same
database
 Permits the data to be physically stored apart from
the application, which facilitates a client-server,
tiered-architecture environment in which multiple
users access a shared database
13– 5
Field Basic Database Elements
Data Item
These terms are used

interchangeably to denote the
smallest block of data that
will be stored and retrieved
in an information system.
13– 6
Basic Database Elements
 A field may be a single character or number, or it
may be composed of many characters or numbers.
Examples:
 Customer name
 Employee Social Security Number
 Purchase order number
 Customer account number
 A logical grouping of fields is called a record.
 Records are groups of data items that concern an
entity such as an employee, a customer, a vendor, an
invoice, etc.
13– 7
Data Occurrences
 A record structure has occurrences, also
called instances.
 A record occurrence is a specific set of data
values for the record.
 For the record…
 EMPLOYEE (NAME, NUMBER, AGE)
 We might have the occurrence…
 EMPLOYEE (Brown, 111222333, 33)
13– 8
Fixed-and Variable-Length
Records
 In a fixed-length record, both the number of
fields and the character length (character
size) of each field are fixed.
 In variable-length records, the width of the
field can be adjusted for each data
occurrence.
 A trailer record is an extension of a master
record.
13– 9
Variable-Length Records
13– 10
The following data pertains to the parts inventory:
It is not possible, in general, to store all information about a particular part

in the following fixed length record:
PART(PART_NO, PNAME, TYPE, COST, PVEND, WARHSE, LOC)
There may be more than one supplier for each part and the two supplier case
would require the following record format:
PART(PART_NO, PNAME, TYPE, COST, PVEND#1, WARHSE#1, LOC#1, PVEND#2,
WARHSE#2, LOC#2)
13– 11
13– 12
 Repeated groups are related groups of fields that
repeat themselves in variable-length records.
 Fields that may give rise to more than one other field
are the parent.
 In general the highest-level element in a tree diagram
is the parent; lower-level elements in the tree
diagram that are connected to the parent are called
children.
 Nodes in the tree are referred to as repeated groups
(segments, groups, or nodes).
13– 13
Tree Diagram for PART,
SUPPLIER, and LOCATION
13– 14
Record Key and File Sequence
 A key or record key is a data item or
combination of data items that uniquely
identifies a particular record in a file.
 Primary sort key (primary key)
 Secondary sort key (secondary key)
 Tertiary sort key
 Relative random order
13– 15
Identify the three levels of database

architecture.
13 – 16
Database Architecture
13– 17
Conceptual Architecture
 The Entity-Relationship (E-R) data model
is a conceptual model for depicting the
relationship between segments.
 The term entity is used instead of
segments.
 The term attribute refers to individual
fields or data items.
13– 18
Database Architecture
13– 19
Conceptual Architecture
 The Object-oriented modeling technique
(OMT) views the components of the system
being modeled as object classes.
 Object class corresponds to a table or
segment, and an object corresponds to a
particular instance or data record.
 An inheritance relationship is created when
an object class is divided into subclasses.
13– 20
Object-Oriented Data Model
13– 21
Compare and contrast the different

logical data models of databases.
13 – 22
Logical Data Structures
 The relationship that exists between the
segments in the database are determined by the
logical data structure, also called the schema, or
database model.
 Three major models of logical data structure:
1. Tree structure
2. Network structure
3. Relational model
13– 23
13– 24
 Both tree and network structures are
implemented with embedded pointer fields,
which cross-link segments.
 In a list organization (list structure), each record
contains one or more pointers (fields) indicating
the address of the next logical record with the
same attribute(s).
 When a record is part of several lists it is called
multilist organization.
13– 25
 A ring structure differs from a list structure in that
the last record in the ring points back to the first
record.
 In a multiple-ring structure, several rings pass
through individual records.
 Hypertext systems are pointer-based that allow users
to browse through databases in random fashion by
selecting key words or objects.
 Semantic data networks are similar to hypertext
systems except the cross-linking can include
multimedia objects.
13– 26
13– 27
Relational Data Structures
 The relational model views the database as a
collection of two-dimensional tables.
 The advantage over tree or network structures
is that there are no complicated pointers or
lists.
 Using relational algebra information can be
extracted with three basic operations:
 Selection
 Join
 Projection
13– 28
 Certain rules called normal forms govern the
creation of tables.
 The process of applying these rules is called
normalization.
 Tables that satisfy these rules are said to be
normalized.
 Tables that do not satisfy these rules are
unnormalized.
13– 29
 The primary purpose of normalization is to
eliminate unnecessary duplication by dividing
tables:
 First normal form – eliminate repeating groups
 Second normal form – no key determines the
values of a non-key field
 Third normal form – no non-key field determines
the values of another non-key field
13– 30
 Terminology of relational databases:
 Relation is synonymous with table.
 Tuple refers to a row in a table.
13– 31
Explain the different methods of

accessing files.
13 – 32
Database Architecture: The
Physical Level
Three file-access methods:
 Sequentially accessed files
 Indexed files
 Direct access files
13– 33
Sequentially Accessed Files
 In a sequential-access file, records can only
be accessed in their predefined sequence.
 Sequential file organization is not a useful
means of storing data when only a small
number of records are accessed in a large
file.
 Sequential files are useful in batch
processing, when all the records in the file
are accessed.
13– 34
Sequentially Accessed Files
13– 35
Indexed Files
 An index file (inverted file) is where an
attribute can be extracted from the records in a
primary file and used to build a new file
whose purpose is to provide an index to the
original file.
 A file is fully inverted when indexes exist for all
its fields.
 An indexed-sequential file is a sequential file
that is stored on a DASD and is both indexed
and physically sorted on the same field (ISAM
files). 13– 36
Indexed Files
13– 37
Direct Access files
 Direct-access files allow individual records to
be retrieved almost instantly without the use of
an index.
 Each record is assigned to a storage location that
bears some relationship to the record’s key
values.
 Most direct-access file systems convert a key to
a storage location address.
 A randomizing transformation is a widely used
method for storing and locating records in a
direct-access file. 13– 38
Direct Access Files
13– 39
Economic Relations Between File
Organization Techniques
 The basic economics of file processing are largely
determined by:
 The activity ratio (the number of accessed records
divided by the number of records in the file), and
 The desired response time for processing and
inquiries (the length of time the user must wait for
the system to complete an operation). Response
time is affected by:
 Physical access time (disk access time)
 Physical distribution of data records on the disk
13– 40
Database Architecture and
Database Development
 The classical approach to database design for
eBusiness applications is to use an E-R
(conceptual) model that is translated into a
relational database (logical model), which is
then implemented using ISAM and/or other
methods.
 In the case of off-the-shelf, prepackaged
eBusiness applications, the database will
typically be generated automatically.
13– 41
 A software database driver, also called a
database connector, can be used to connect
a business application to the DBMS.
 Using a database driver, it is possible to
make the business application work with a
completely different DBMS by simply
changing the database driver.
13– 42
 An alternate approach to database design is
the object-oriented (OO) modeling.
 Advantage is that OO modeling can be readily
transferred into OO program code.
 In practice, relational databases outperform
object-oriented databases and therefore the E-
R approach is the main approach used to
model databases.
13– 43
Other Types of Logical Structures
and Related Databases
 OLAP (OnLine Analytical Processing) is
viewed as a multidimensional
generalization of the two-dimensional
relational table.
 The advantage of OLAP is that it provides
lightening fast responses to complicated
queries.
 OLAP is used in data mining applications.
13– 44
Other Types of Logical Structures
and Related Databases
 In-Memory databases differ from
conventional databases in that the entire
database is loaded into computer-internal
high-speed RAM or other high-speed
electronic storage device.
 The elimination of the relatively slow
physical disk media results in enormous
gains in speed.
13– 45
ACID: Reliable Processing of
Database Transactions
 Fundamental requirements to ensure the reliability
of processing database transactions:
 ACID (Atomicity, Consistency, Isolation, and
Durability):
 Atomicity – the entire transaction is completed or no
part of it is completed.
 Consistency – only valid data will be written to the
database.
 Isolation – other operations cannot interfere with a
transaction that is being processed.
 Durability – a transaction is not undone if the system
fails after it is completed.
13– 46
Learning Objectives 5 & 6
Explain the benefits of database

management systems.
Describe the considerations that are

appropriate to the design of
databases.
13 – 47
Database Management Systems
and Databases in Practice
 A DBMS comprises database software and an
associated database.
 The database software inputs data to the database,
retrieves data from the database, and manipulates
data in the database.
 All DBMSs contain three common attributes for
managing and organizing data:
 Data Description Language (DDL)
 Data Manipulation Language (DML)
 Data Query Language (DQL)
13– 48
SQL Data Manipulation Language
 SELECT – Retrieves rows from tables
 UPDATE – Modifies the rows of tables
 DELETE – Removes rows from tables
 INSERT – Adds new rows to tables
13– 49
High-Level Query Languages
 Query by Example (QBE)

 SELECT * FROM Customers
WHERE Name = ‘Jane Morris’
AND ZipCode = ‘33301’
13– 50
High-Level Query Languages
 Natural Language Database Query
 Object Query Language
 Java Data Objects Query Language
13– 51
Why Database Management
Systems Are Needed
 DBMSs integrate, standardize, and
provide security for various accounting
applications.
 In the absence of integration, each type of
accounting application such as sales,
payroll, and receivables will maintain its
own separate, independent data files.
13– 52
Data Independence
 The solution to the problem with maintaining
independent files lies in separation of the
physical handling of data from their logical use -
it requires two fundamental changes:
 Data is integrated into a single database.
 All access to the integrated set of files (database)
is through a single software system.
 A database dictionary is a collection of all data
item names, description, etc.
13– 53
Database Management Concepts
13– 54
Database Documentation and
Administration
 Database dictionaries are used both alone
and with DBMSs to centralize, document,
control, and coordinate the use of data
within an organization.
 The data dictionary is simply another file, a
sort of file or files, whose record
occurrences consist of data item
descriptions.
13– 55
Data Dictionary Format
13– 56
End of Chapter 13
13 – 57

Data Management Concepts: 2013 Pearson Education, Inc. Publishing As Prentice Hall, AIS, 11/e, by Bodnar/Hopwood

Uploaded by

Copyright:

Available Formats

Data Management Concepts: 2013 Pearson Education, Inc. Publishing As Prentice Hall, AIS, 11/e, by Bodnar/Hopwood

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Management Concepts: 2013 Pearson Education, Inc. Publishing As Prentice Hall, AIS, 11/e, by Bodnar/Hopwood

Uploaded by

Copyright:

Available Formats

Data Management Concepts

Define the basic terms used in

These terms are used

It is not possible, in general, to store all information about a particular part

Identify the three levels of database

Compare and contrast the different

Explain the different methods of

Explain the benefits of database

Describe the considerations that are

 Query by Example (QBE)

You might also like