DATABASE – collection of integrated data or
records.
RECORD – representation of a physical or
conceptual entity
TABLE – is the core of structure for storing data
FIELD – is a part of a record and contains a single
piece of data for the subject record
Purpose of database system is stored in files
DRAWBACK OF USING FILE SYSTEM TO STORE
DATA
DATA REDUNDUNCY AND INCONSISTENCY –
multiple file formats and duplication of
information on different files
DIFFICULTY IN ACCESSING DATA – need to write
a new program carry out each task
DATA ISOLATION – multiple files and format
DATA SECURITY – hard to provide users access
to some but not at all, data
TYPES OF DATABASES
 SINGLE USER DATA – a database that
support only one users at a time
 MULTIUSER DATA - a database that
support multiple concurrent users
 WORKGROUP DATABASE – usually
support fewer than 50 users or is used
for a specific department in an
organization
 ENTERPRISE DATABASE – the overall
company data representation which
provide support from present and
expected future needs
 CENTRALIZED DATABASE- a database
located at a single site
 CLOUD DATABASE – a database that is
created and maintained using cloud
services such Microsoft azure or amazon
aws
DATABASE MANAGEMENT SCIENCE (DBMS)
- is a collection of data and set of programs
to access and store those data in easy and
efficient data
DATABASE APPLICATION:
 BANKING: TRANCSACTION
 AIRLINES :RESERVATION,SCHEDULE
 UNIVERSITIES:
REGISTRATION,GRADES
 SALES: CUSTOMER,PRODUCTS
 ONLINE RETAILER:ORDER TRACKING
 MANUFACTURING:
PRODUCTION,INVENTORY
 HUMAN RESOURCES: EMPLOYEE
RECORDS
DB2
 Developed by IBM
 Abbreviation for “IBM
DATABASE 2”
 Introduced in june 1983
 Support relational model
 Platform specific DB2 product
 Supports SQL
 Version is DB2 10.5
 DB2 for LINUX,UNIX AND
WINDOWS
LEVEL OF ABSTRACTION
1. PHYSICAL LEVEL – describe how a data is
stored
2. LOGICAL LEVEL - the way a person views
data within the context of a problem
domain
3. View level- application programs hide
details of data types.
Data model – a representation, usually graphic,
of a complex “real-world” data structure.
 Hierarchical model – This model is based
on an upside-down tree structure in
which record is called a segment. The
top record is the root segment. Each
segment has a 1:M relationship to the
segment directly below it.
 Network model – An early data model
that represent data as a collection of
records types in 1:M relationships.
o Schema – is the conceptual
organization of the entire as viewed by
the database administrator
o - a logical groupings of database
objects such as tables, indexes, views
and queries that are related to each
other
o Subschema – defines the portion of the
database “seen” by the application
programs that actually produce the
desired information from the data
within the database
o A data manipulation language (DML) –
the set of commands that allows an end
user to manipulate the data in the
 database such as SELECT, INSERT,
UPDATE, DELETE, COMMIT and
ROLLBACK
o also known a query language
o SQL is the most widely used
commercial language
Relational Model
 All the data is stored in various tables.
 Example of tabular data in the relational
model

A schema data definition language (DDL) – a

language that allows a database administrator to
define the database structure, schema and
subschema

 Specification notation for defining the

database schema

Example: create table instructor (

 ERD – a diagram that depicts an entity
ID char(5),
relationship model’s entities, attributes,
name varchar(20),
and relations.
dept_name varchar(20),
salary numeric(8,2))

 DDL compiler generates a set of table

templates stored in a data dictionary
 Data dictionary contains metadata (i.e.,
data about data)
 Database schema
 Integrity constraints - Primary
key (ID uniquely identifies
instructors)  Object-oriented data model (OODM) a
 Authorization - Who can access data model whose basic modeling
what structure is an object

 Relational model – Each relation (table)

is conceptually represented as a two-
dimensional structure of intersecting
rows and columns. The relations are
related to each other through the
sharing of common entity characteristics
(values in columns)

 Entity-Relationship data model (mainly

for database design) - A diagram that
depicts an entity relationship model’s
entities, attributes, and relations.

 Object-oriented data model (OODM) –

a data model whose basic modeling
structure is an object

 Extensible Markup Language (XML) – a  NoSQL – is a large-scale distributed

database system that stores and database system that stores structured
manages semistructured XML data and unstructured data in efficient ways

 NoSQL – a new generation of DBMS that Characteristics of NoSQL database:

is not based on a traditional relational
o They are not based on the relational
database model
model and SQL

o They support highly distributed

database architectures
 o They provide high scalability, high
availability and fault tolerance
o They support very large amount of
sparse data
o They are geared toward performance
rather than transaction consistency.
RELATIONAL TABLE
1. Perceived as a two-dimensional structure
composed of rows and columns
2. Each table row (tuple) represents a single
entity occurrence within the entity set
3. Each table column represents an attribute,
and each column has a distinct name
4. Each intersection of a row and column
represents a single data value
5. All values in a column must conform to the
same data format
6. Each column has a specific range of values
known as the attribute domain
7. The order of the rows and columns I s
immaterial to the DBMS
8. Each table must have an attribute of
combination of attributes that uniquely
identifies each row
DBM CAN SUPPORT DIFFERENT DATA TYPE
1. NUMERIC – you can use numeric data to
perform meaningful arithmetic procedures
2. CHARACTER – also known as text data or
string data
- can contain any character or
symbol not intended for mathematical
manipulation
3. DATE – contain calendar dates stores in a
special format known as the Julian data format
4. LOGICAL- can ONLY have true or false
RELATIONAL DATABASE
PRIMARY KEY (PK) - an identifier composed of
one or more attributes that are uniquely
identifies a row
- a candidate key selected
as a unique entity identifier
FOREIGN KEY (FK) – an attribute or attributes in
one table whose values must match the primary
key in another table or whose values must be
null
RELATIONAL ALGEBRA – set of mathematical
principles that form the basis for manipulating
relational table contents
MAIN FUNCTION
1. Select 5. Union
2. Project 6. Difference
3. Join 7. Product
4. Intersect 8. Divide
RELVAR - short for relation variable
- container(variable) for holding relation
data, not the relation itself
RELATIONAL SET OPERATORS
1. SELECT - used to select a subset of rows
- also known as RESTRICT
2. PROJECT -used to select a subset of columns
3. UNION - used to merged (append) 2 tables
into a new table, dropping the duplicate rows
- table must be UNION-COMPTIBLE
*UNION COMPATIBLE – 2 or more
tables that have same number of columns and
corresponding columns have compatible
domains
4. INTERSECT - used to yield ONLY the rows that
are common to 2 union-compatible tables
5. DIFFERENCE – used to yield all rows form one
table that are not found in another union-
compatible table
6. PRODUCT - used to yield ALL possible pairs of
rows from 2 tables
- also known as CARTESIAN PRODUCT
7. JOIN - used to yield rows from 2 tables based
on criteria. Types of join: Natural join, Theta
join, Equijoin and Outer join
*NATURAL JOIN – yields a new table composed
of only the rows with common values in their
common attributes
*THREE-STAGE PROCESS
1. Product
2.Select
3. Project
*JOIN COLUMN - used in criteria
- generally share similar values
*LEFT OUTER JOIN – yields all the rows
in the left table, including those that have no
matching values in the other values
*RIGTH OUTER JOIN – yields all the row
in the right table, including the ones with no
matching values in the other table