CENTER FOR

MANAGEMAENT STUDIES

PROJECT REPORT
ON
DBMS

1
 SUBMITTED BY
1) MRUGA PATEL
2) SANKET KANABAR
3) SWINI PATEL
4) AMAR MERCHENT
5) DEVAL GODANI

2
 WHAT IS DATA?
 DATA ARE RAW FACTS.

 THE WORD RAW INDICATES THAT THE

FACTS HAVE NOT YET BEEN PROCESSED
TO REVEAL THEIR MEANING.

3
 WHAT IS DATABASE?
 A DATABASE IS SHARED,INTEGRATED
COMPUTER STRUCTURE THAT STORES
A COLLECTION OF:

 END-USER DATA,THAT IS RAW FACTS

OF INTEREST TO THE END-USER.
 METADATA OR DATA ABOUT
DATA.THROUGH WHICH THE END-
USER DATA ARE INTEGRATED AND
MANEGED. 4
WHAT IS DATA MANAGEMENT?

 IT IS A DISCIPLINE THAT FOCUSES ON

THE PROPER GENERATION,STOREG
AND RETRIEVAL OF DATA.

5
 DBMS IS A STANDS FOR DATA BASE
MANAGEMENT SYSTEM.
WHAT IS DBMS?
 DBMS IS A COLLECTION OF
PROGRAMES THAT MANAGES THE
DATABASE STRUCTURE AND
CONTROL ACCESS TO THE DATA
STORED IN THE DATABASE.

6
 TYPES OF DATABASES

DATABASE
DATABASEHAVE
HAVEAAEIGHT
EIGHTTYPES:
TYPES:
SINGLEUSER
 DATABASE
SINGLEUSER DATABASE
MULTIUSER
MULTIUSERDATABASE
DATABASE
DESKTOP
DESKTOPDATABASE
DATABASE
WORKGROUP DATABASE
WORKGROUP DATABASE
ENTERPRISE DATABASE
ENTERPRISE DATABASE
CENTRALIZED DATABASE
CENTRALIZED DATABASE
DISTRIBUTED DATABASE
DISTRIBUTED DATABASE
OPERATIONAL DATABASE
OPERATIONAL DATABASE

7
 DESCRIPTION
 SINGLEUSER DATABASE::
 A SINGLEUSER DATABASE SUPPORTS
ONLY ONE USER AT A TIME.
 IN OTHER WORDS,IF USER A IS USING A
DATABASE;USER B AND C MUST WAIT
UNTIL USER A IS DONE.
 DESKTOP DATABASE::
 A SINGLEUSER DATABASE THAT RUNS ON
A PERSONALCOMPUTER IS KNOWN AS
THAT.
8
 DESCRIPTION
 MULTIUSER DATABASE::
 MULTIUSER DATABASE SUPPORT
MULTIPLE USER AT THE SAME TIME.
 WORKGROUP DATABASE::
 WHEN THE MULTIUSER DATABASE
SUPPORTS A RELATIVELY SMALL
NUMBER OF USERS(USALLY FEWER
THAN 50)OR A SPECIFIC DEAPARTMENT
WITHIN AN ORGANIZATION.

9
 DESCRIPTION
 ENTERPRISE DATABASE::
 WHEN THE DATABASE USED BY THE
ENTIRE ORGANIZATION AND SUPPORTS
MANY USERS(MORE THAN 50 USUALLY
100)ACROSS MANY DEPARTMENTS.
 CENTERLIZED DATABASE::
 LOCATION MIGHT ALSO BE USED TO
CLASSFY THE DATABASE.
 DATABASE THAT SUPPORTS DATA
LOCATED AT A SINGLE SITE IS KNOWN AS “
10
 DESCRIPTION
 DISTRIBUTED DATABASE::
 A DATABASE THAT SUPPORT DATA
DISTRIBUTED ACROSS SEVERAL
DIFFERENT SITES IS CALLED A THAT.
 OPERATIONAL DATABASE::
 IT IS USED FOR COMPANY’S DAY-TO-
DAY OPERATIONS.

11
 ADVANTAGES OF THE DBMS
 IMPROVED DATA SHARING
 BETTER DATA INTEGRATION
 MINIMIZED DATA INCONSISTENCY
 IMPROVED DATA ACCESS
 IMPROVED DECISION MAKING
 INCREASE END-USER PRODUCTIVITY

12
 WHAT IS A DATA MODELS?
 DATA MODELS IS COMBINATION OF
AN ENTITY AND RELATIONSHIP
WHICH IS CONTAIN A TWO OR
MORE THAN TWO ATTRIBUTES.

13
 TYPES OF DATA MODELS
DATA MODELS HAVE A FIVE
TYPES:
 HIERARCHICAL MODEL
 NETWORK MODEL
 RELATIONAL MODEL
 ENTITY RELATIONSHIP MODEL
 OBJECT-ORIENTED MODEL

14
 HIERARCHICAL MODEL
ADVANTAGES:
 IT WAS DEVELOPED IN 1960s TO
MANAGE LARGE AMOUNTS OF DATA.
 ITS BASIC LOGICAL STRUCTURE IS
REPRESENTED BY AN UPSIDE-DOWN
“TREE”.
 IT IS CONTAIN LEVELS OR SEGMENTS.

15
 HIERARCHICAL MODEL
DIS-ADVANTAGES:
 IT WAS NOT POSSIBLE TO ENTER A
NEW LEVEL OR SEGMENT INTO THE
SYSTEM.
 IT WAS NOT SUPPORTED TO MANY
TO MANY RELETIONSHIP.
 IT WAS COMPLEX TO IMPLEMENT.
 IT WAS DIFFICULT TO MANAGE.
16
HIERARCHICAL MODEL

A B

A B
A

17
 NETWORK MODEL
ADVANTAGES:
 IT WAS REPRESENTED COMPLEX DATA
RELATIONSHIPS MORE EFFECTIVELY
THAN THE HIERARCHICAL MODEL.
 IT WAS CREATED FOR IMPROVE
DATABASE PERFORMANCE.
 IT MADE DATABASE DESIGNS AND
APPLICATIONS LESS PORTABLE.

18
 NETWORK MODEL
DIS-ADVANTAGES:
 AS RESULT OF THE INCREASED
COMPLIXITY MAPPING OF RELATED
DATA BECOME VERY DIFFICULT.
 IT IS A RESEMBLES THE
HIERARCHICAL MODEL.
 IT IS ALLOWS A RECORD TO HAVE
MORE THAN ONE PARENT.

19
NETWORK MODEL

A
A

A
A BB
20
 RELATIONAL MODEL
ADVANTAGES:
 IT WAS REPRESENTED A MAJOR
BREAKTHROUGH FOR BOTH USERS
AND DESIGNERS.
 IT IS IMPLEMENTED THROUGH A
VERY SOPHISTICATED RELETIONAL
DATABASE MANAGEMENT
SYSTEM(RDBMS).

21
 RELATIONAL MODEL
DIS-ADVANTAGES:
 THE RDBMS REQUIRES BOTH
HARDWARE AND SYSTEM
SOFTWARE.
 REUSIBILITY OF A STRUCTURE IS
NOT POSSIBLE THROUGH UNLIKE
THE PREVIOUS MODELS ALTERING
THE STRUCTURE IS POSSIBLE.

22
 RELATIONAL MODEL
AGENT_CODE AGENT_LN AGENT_FN AGENT_A CODE AGENT_PH
NO

501 ALBY ALEX 713 228-1249

502 HAHN LEAH 615 882-1244

CUS_CODE CUS_LN CUS_FN CUS_PHNO AGENT_COD

E
10010 RAMAS ALFRED 844-2573 502

10011 DUNNE LEONA 894-1238 501

23
ENTITY RELATIONSHIP MODEL

ADVANTAGES:
 IT IS COMBINATION OF AN ENTITY
AND RELATIONSHIPS.
 ER MODEL DEVELOPED IN 1976.
 IT WAS THE GRAPHICAL
REPRESENTATION OF ENTITIES AND
THEIR RELATIONSHIPS IN A
DATABASE STRUCTURE.
24
 ENTITY RELATIONSHIP MODEL

DIS-ADVANTAGES:
 THERE IS LIMITED CONSTRAINT
REPRESENTATION.
 THERE IS LIMITED RELATION
REPRESENTATION.
 THERE IS NO DATA MANIPULATION
LANGUAGE.

25
ENTITY RELATIONSHIP MODEL

paints PAINTING
PAINTER S

EMPLOYE learns SKILL

E

EMPLOYE manages
STORE
E

26
 OBJECT-ORIENTED MODEL
ADVANTAGES:
 IN THAT BOTH DATA AND THEIR
RELATIONSHIP ARE CONTAINED IN A
SINGLE STRUCTURE KNOWN AS
OBJECT.
 VISUAL REPRESENTATION INCLUDES
SEMANTIC CONTENT.
 DATA INDEPENDENCE AND
STRUCTURE INDEPENDENCE.
27
 OBJECT-ORIENTED MODEL
DIS-ADVANTAGES:
 COMPLEX NAVIGATIONAL SYSTEM.
 STEEP LEARNING CURVE.
 HIGH SYSTEM OVERHEAD SLOW
TRANSACTION.

28
 ENTITY RELATIONSHIP MODELING

ERM’S MAIN COMPONANATS:

 ENTITY
 ATTRIBUTES
 RELATIONSHIP

29
 ENTITY RELATIONSHIP MODELING

 ENTITY:
 ENTITY IS AN OBJECT OF INTEREST TO
THE END USER.
 AN ENTITY IS REPRESENTED BY A
RECTANGLE CONATAING THE ENTITY’S
NAME.
 THE ENTITY NAME, A NOUN,IS
USUALLY WRITTEN IN ALL CAPITAL
LETTERS.
30
 ENTITY RELATIONSHIP MODELING

 ATTRIBUTES:
 ATTRIBUTES ARE CHARACTERISTICS
OF ENTITIES.
 THE ATTRIBUTES ARE WRRITEN IN
THE ATTRIBUTE BOX BELOW THE
ENTITY RECTANGLE.

31
 ENTITY REALATIONSHIP MODELING

 RELATIONSHIPS:
 A RELATIONSHIP IS AN
ASSOCIATION BETWEEN ENTITIES.
 RELATIONSHIP HAVE A THREE
TYPES:
1. 1:MONE TO MANY
2. M:MMANY TO MANY
3. 1:1ONE TO ONE
32
 ENTITY RELATIONSHIP MODELING

 1:M-(ONE TO MANY)::
 A PAINTER CAN PAINT MANY
PAINTINGS; EACH PAINTINGS IS
PAINTED BY ONE PAINTER.
1 M

paints PAINTING
PAINTER paints PAINTING
PAINTER S
S

33
ENTITY RELATIONSHIP MODELING

 M:M-(MANY TO MANY)::
 AN EMPLOYEE CAN LERAN MANY
SKILLS; EACH SKILL CAN BE LEARNED BY
MANY EMPLOYEES.
M M

learns SKILL
EMPLOYEE learns SKILL
EMPLOYEE

34
ENTITY RELATIONSHIP MODELING

 1:1-(ONE TO ONE)::
 AN EMPLOYEE MANAGES ONE STORE;
EACH STORE IS MANAGED BY ONE
EMPLOYEE.
1 1
EMPLOYEE manages STORE
EMPLOYEE manages STORE

35
 INTEGRITY & CONSTRAINTS
 THE DATA VALUES STORED IN THE
DATABASE MUST SATISFIES CERTAIN
CONSISTENCY CONSTRIANTS
 THE INTEGRITY CONSTRIANTS ARE
KEPT IN SPECIAL SYSTEM STRUCTURE
THAT IS CONSULTED BY THE
DATABASE SYSTEMS,WHENEVER AN
UPDATE TAKES PLACE IN THE
SYSTEMS.
36
 CONSTRAINTS
CONSTRAINTS HAVE A THREE
TYPES:
 DOMAIN INTEGRITY CONSTRAINT
 ENTITY INTEGRITY CONSTRAINT
 REFERENTIAL INTEGRITY CONSTRIANT

37
DOMAIN INTEGRITY CONSTRAINTS

IT IS CONTAIN TWO CONTENTS::

 CHECK CONSTRIANT ::
 CHECK CONSTRIANT MUST SPECIFIED AS
A LOGICAL EXPRESSION THAT EVALUTES
EITHER TRUE OR FALSH CHECK
CONSTRAINT DEFINE AT COLUMNS
LEVEL.
 IT REQUIRES THAT A CONDITION BE TRUE
OR UNKNOWN FOR THE ROW TO BE
PROCESSED.
38
 DOMAIN INTEGRITY CONSTRAINTS

 RESTRICTION ON CHECK CONSTRAINTS::

 IF AN SQL STATEMENT CAUSES THE
CONDITION TO EVALUTE TO FALSE, AN
APPROPRIAT ERROR MESSAGE IS DISPLAY
AND PROCESSING WILL BE STOP.
 THE CONDITION MUST BE A BOOLEAN
EXPRESSION THAT CAN BE EVALUTED
USING THE VALUES IN THE ROW BEINGS
INSERTED AND UPDATE.

39
ENTITY INTEGRITY CONSTRAINTS

IT IS CONTAIN A TWO CONTENTS::

 UNIQUE CONSTRAINTS::

 TO PURPOSE OF A UNIQUE KEY IS TO

ENSURE THAT THE COLUMN(S) IS

UNIQUE.
 A VALUE ENTERED IN COLOMN(S)

DEFINED IN THE UNIQE CONSTRIANT

MUST NOT BE REPEATED ACROSS THE
COLUMN(S).
40
ENTITY INTEGRITY CONSTRAINTS

 PRIMARY KEY CONSTRIANT::

 A PRIMARY KEY IS ONE OR MORE
COLUMN(S) IN A TABLE USED TO
INDENTIFY EACH ROW IN TABLE.
 A PRIMARY KEY COLUMN IN A
TABLE HAS SPECIAL ATTRIBUTES.
 THE COLUMN CAN NOT BE ACCEPT
A NULL ATTRIBUTE.

41
 REFERENTIAL INTEGRITY
CONSTRIANT
IT IS CONTAIN A TWO CONTENTS::
 FOREIGN KEY CONSTRAINT::
 A FOREIGN KEY IS KNOWN AS
REFERANCE KEY.
 A FOREIGN KEY IS A COLUMN WHOSE
ARE DERIVED FROM THE PRIMARY
KEY OR UNIQUE KEY OF SOME OTHER
TABLE.

42
 REFERENTIAL INTEGRITY
CONSTRIANT
 PRINCIPLES OF FOREIGN KEY::
 REJECTS AN INSERT AND UPDATE OF A
VALUE IF A CORRESPONDING VALUE
DOESN’T CURRENTLY EXIST IN THE MASTER
KEY TABLE.
 FOREIGN KEY WILL AUTOMATICALLY
REFERENCE THE PRIMARY KEY OF THE
MASTER TABLE IF NO COLUMN OR GROUP
OF COLUMNS IS SPECIFIED WHEN CREATING
THE FOREIGN KEY.
43
 STRUCTURED QUERY LANGUAGE
 A DATABASE LANGUAGE ALLOWS YOU TO
CREATE DATABASE AND TABLE
STRUCTURES.
 SQL IS USE TO PERFORM SOME COMPLEX
QUERY WITH THE HELP OF IT WE CAN
MANAGE A DATABASE IN EASY FORM.
 SQL FUNCTION FIT INTO TWO CATEGORIES:
 DDL(DATA DEFINATION LANGUAGE)
 DML(DATA MANIPULATION LANGUAGE)

44
 STRUCTURED QUERY LANGUAGE
 DATA DEFINATION
LANGUAGE(DDL)::

 SQL INCLUDES COMMANDS TO

CREATE DATABASE OBJECTS SUCH AS
TABLES,INDEXES,VIEWS AS WELL AS
COMMANDS TO DEFINE ACCESS
RIGHTS TO THOSE DATABASE OBJECTS.

45
STRUCTURED QUERY LANGUAGE
 DATA MENIPULATION
LANGUAGE::

 IT INCLUDES COMMANDS TO
INSERT,UPDATE,DELETE AND
RETRIEVE DATA WITHIN THE
DATABASE TABLES.

46
 STRUCTURED QUERY LANGUAGE
 INSERT QUERY::IT USED TO INSERTS
ROWS INTO THE TABLE.
 SELECT QUERY::IT USED TO SELECT
ATTRIBUTES FROM ROWS IN ONE OR
MORE TABLES OR VIEWS.
 UPDATE QUERY::IT IS USED TO MODIFIES
AN ATTRIBUTE’S VALUES IN ONE OR
TABLE’S ROWS.
 DELETE QUERY::IT IS USED TO DELETES
ONE OR MORE ROWS FROM A TABLE.
47
 SWINI
SWINI SANKET
SANKET

THANKS
TO
DEVAL
DEVAL AMAR
AMAR

YOU MRUGA
MRUGA

48