B SC CS SY Unit I Introduction & Basic Concept

 Data: Anything can be called data.

Ex. Name of Person
Name of City
Number
 Information : When a data is meaningful is called Information
 Database : It is an organized collection of related Information, because
only organized collection of is database
Ex. : Dictionary
 DBMS : DBMS is nothing but Database Management System, It is
system S/W that allow access to data content is DBMS.
 RDBMS : A relational Database Management System is a program that
lets you create, update and administer a relational database.
Most Commercial RDBMS use the structured Query Language (SQL) to
access the database.
 Structure of DBMS :

Fig. Structure of DBMS

Prepared By, V D Patil
COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

DBMS is used to manage store & manipulate the data. Following are the users
that wants in Database Management System.
1. Naive User: The Naive User interactive with the system by invoking
application program or S/w have been previously written.

2. Casual User: The Casual User is the S/W Programmers or Professional

Programmers. This is responsible for Application Programming & S/W.

3. Database Manager: It is simple called as Database Control System. It is

also responsible for integrity & security, hacker, recovery of the data.

4. File Manager: The File Manager is responsible for structure of files. It is

also responsible for transmitting the required record to the Data Manager.

5. Disk Manager: The Disk Manager is part of the operating System of the
host Computer & all physical Input & Output operations are performed
by it.
6. Query Processor: The Query processor is used to interact the online
user’s Query & Convert it into series of operations in a form capable of
being sent to the Data Manager for evolution.
7. Telecomm System: Online users of a Computer System whether remote
or local communicate with in by sending & receiving messages over
communication lines. These messages are routed via an independent S/W
System Called a Telecommunication System or a Telecommunication
Control Program.
8. Data Files: Data files according the database.
9. Data Dictionary: The Data Dictionary which is a database itself,
documents the data.
10.DBA (Database Administrator): A person or the group of person, who
controls the database system is called as DBA. It is responsible for
creating Maintaining, Modifying the structure of Database System.

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Advantages of DBMS
1. Reduction of data redundancy:
Duplication of data is called as redundancy, while creating a database it
might be possibility record is repeated that repetition is called as
redundancy.
In DBMS Overall data can be control by the DBA, so it avoid that
unnecessary duplication of data.
2. Sharing of data:
DBMS allows multiple user to access the database at the same time. The
control database is to store many users. This is concept of sharing of data.
3. Security:
Data is IMP part of any organization & may be confidential such
confidential data must not be accessed by unauthorized persons or users.
The DBA is responsible for ensuring such kind of security has to design
proper authentication method for access of DBMS.
4. Integrity:
DBMS provides data integrity data integrity means data presentation
database is both accurate & consistent data enter in database should be
specified range of correct format.
Ex.: We can apply the constrains of database.
5. Centralize Control:
DBMS provide centralize control to database organize on may its data
central & content database by database administrator.
The advantage of database, the centralize control is we can easily
maintain backup & recovery.
Disadvantages of DMBS
1. Cost of S/W & H/W:
The main disadvantage of DBMS is cost. The cost of purchasing or
develop the S/W as well as H/W has to upgraded to allow for expensive
program & above the workspace require for their storage & execution .

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

2. Problem with centralization:

Centralization will the data is accessible from a single source it is cases,
fail then whole system goes down.

3. Complexity backup & recovering:

When centralized control reduce the application, the lack of duplication
requires that the database can be adequately backup. So that case of
failure of data can be recovery operation are fairly complex in DBMS
environment.
User of DBMS
1. Naive User:
The Naive User interactive with the system by invoking application
program or S/w have been previously written.
2. Online Users:
These are users who may communicate with the database directory via
an online terminal or indirectly via a user interface and application
program.
The more sophisticated of these users may also use a data
manipulation language to manipulated, the database directly.
3. Application programmers:
Professional programmers who are responsible for developing
application programs or user interfaces arrized by the naive user &
online users fall into this category.
The application programs could be written in general purpose,
programming language such as Assembler, C, COBOl, FORTRAN,
Pascal and include the commands required to manipulate the database.
4. Database Administrator (DBA):
The person or group of perform who controls the database system is
called as DBA.
It is responsible for creating, maintaining, modifying the structure of
database system.

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Relational Database
1. Entity:
An entity can be a real-world object that can be easily identifiable.
For Ex.: In a school database, students, teachers, classes & courses
offered can be considered as entities.
All these entities have some attributes of properties that give them their
identity.
2. Attribute:
Each object or entity having some property called as attribute.
In the file system, the file is used to specify properties, the object in
RDBMS attributes corresponded to the bill.
Ex: The object person have properties like age, color & so on.
3. Domain:
Set of values of same data type is called as domain.
The domain is set of homogenous members. A domain can be defined
as D.
There are two types of Domain.
a) Atomic Domain:
The atomic domain is that its elements are non-composite or indivisible.
Ex: Set of integers.

b) Composite domain:
The composite domain is that its elements are composite & divisible.
Ex.: Attribute name could be composite
Name
First Name Middle Name Last Name
The domain for an attribute address specifies street no’s, street city,
state, considered as composite domain.

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Tuples:
Object entity having attributes can be presented by an ordered set called as
tuples.
Assume that n attributes take values from the domain D1, D2. ......Dn.
An resulting set of Cartesian product of domain contains all possible N tuples.
Ex.
Applicant
Name Age Profession
Ajit 20 S/W developer.
The applicant object can be represent by following values
[Ajit, 20, S/W develop]
This possible order obtained from Cartesian product of domain for attributes,
name, age & profession is called as tuple.
Tuple corresponds to records in the database file & set of tuples is called as
Relation or Database table.
Relations & their schemes:
Relational algebraic operations:
Relational algebra is a collection of operations that used to manipulate the
relations.
The relational algebraic operations are divided into two parts:
1. Basic set oriented operations, that contains
a. Union:
In this operation represent set or relation contains the tuples that
are either in the first relation or in second relation at in both of
them. Duplications eliminated in this operation.
Ex. Consider following two tables:
P Q
Id Name Id Name
101 Vaibhav 101 Vaibhav
102 Akshay 105 Vaijinath
103 Arun 106 Tanaji
104 Sudhir 102 Akshay

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

It P(P) & Q(Q) are the two compatible relations. The Union of P &
Q can be calculated as follow:

R= P U Q
Or

R= {t / t € p v t € Q]
Following table or relation shows the O/P of P U Q
R
Id Name
101 Vaibhav
102 Akshay
103 Arun
104 Sudhir
105 Vaijnath
106 Tanaji
b. Set the difference operation:
The difference operation removes common on tuples from first
relation.
It allows find tuples that are available in first relation but not in
other relation.

Ex.:
P Q
Id Name Id Name
101 Vaibhav 101 Vaibhav
102 Akshay 105 Vaijinath
103 Arun 106 Tanaji
104 Sudhir 102 Akshay

This relation represent as:

R= P - Q
Or

R= {t / t € p ˄ t € Q]

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

The O/P is
R
Id Name
103 Arun
104 Sudhir
c. Intersection operation:
The intersection operation success a display the common tuples
from the two relation.
This operation is represented as
Ex.:
P Q
Id Name Id Name
101 Vaibhav 101 Vaibhav
102 Akshay 105 Vaijinath
103 Arun 106 Tanaji
104 Sudhir 102 Akshay

R= P ˄ Q
Or

R= {t / t € p ˄ t € Q]
The O/P is,

R
Id Name
101 Vaibhav
102 Akshay

d. Cartesian product:
The Cartesian product of two relations is the concatenation of
tuples belonging to the two relation a new resultant relation’s
created.
Which is having all possible concatenation of tuples.

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Ex.:

Emp Sal
Id Name Salary
e1 Amit 5000
e2 Amol 6000
e3 suman 7000
The cartetion product can be represented as ,

R = Emp × Sal
or

R = {t1 || t2| t1€ Emp ˄ t2 € Sal}

Here the result is obtain by can containing each tuple in all relation
Emp with each tuple in relations salary.
Relation oriented / Additional operation:
Basic set operation provides very limited data manipulation facility so that
purpose RDBMS provides some additional relation oriented operation on these
are of following:
i) Projection (╥)
The projection of relation is define as a projection as all its tuples over
some set of attributes. Ex.:
Employee
Emp_Name Salary

Rahul 5000
Kailas 6000
Renuka 4000
Radhika 3000
Rahul 2000
Following is the representation of projection, operator.
╥ Emp_Name Employee
The result of above statement is as,

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Emp_Name
Rahul
Rajesh
Kailas
Renuka
Radhika
ii) Selection (6):
In this type of operation it success only some of the types of the
relation:
Ex.:
Employee
Id Name Salary
e101 Rajesh 6000
e102 Rahul 7000
e103 Renuka 4000
e104 Radhika 8000
Selection operation are as follows :
Id = ‘e101’ (Employee)
Then O/P is,
Employee
Id Name Salary
e101 Rajesh 6000
iii) Join ( )
The join operation combines two relations to perform a finalize
relation ex.
Student Stud
Roll_No Name Roll_No City
1 Rahul 1 Latur
2 Rajesh 2 Pune
3 Radhika 3 Mumbai
It me wants join these table tlen,
R = Student Stud

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

The O/P is,

Roll_No. Name City

1 Rahul Latur
2 Rajesh Pune
3 Radhika Mumbai
iv) Division (÷)
The relation employee on project, the result as employee divided by
projects is the relation.
Ex.:
Employee Projects
Emp_Id Project Project
e101 CA3404 CA3404
e103 CA3405 CA3405

In the above Employee

(e101, CA3404) & (e101, CA3405)
Must both, we tuple in employee also it is true for (e103, CA3404) &
(e103, CA3405)
So the result of division operation are as follows:
R
Emp_Id
e101
e103

Prepared By, V D Patil

COCSIT, Latur
B SC CS SY Unit I Introduction & Basic Concept

Prepared By, V D Patil

COCSIT, Latur