DBMS IN SHORT

2. IT IS A DATABASE IN WHICH WE
CAN STORE INFORMATION SHARED
COLLECTION OF INTER RELATED
DATA
 IT IS ORGANIZATON IN WHICH
DATA CAN RUN EASILY.
 A COLLECTION IN WHICH DATA
CAN IS STORED AND RUNEASILY.

3.  A DATA IS AN ORGANIZED
COLLECTION OF DATA FROM OF
RELATED DATA WITH AN IMPLICIT
MEANING AND HENCE IS A DATA
BASE.

4.  BETTER DTATA INTEGRATION.
 FASTER DATA ACESS
 SIPLICITY
 RECOVERY BACKUP
 MIIMIZED DATA CONSISTENCY
 UED IN VARIOUS MAJOR FIELDS LIKE
SCHOOLS, COLEEGE
,FACTORIES,HOSPITALS.


5.  DATABASE HANDLING STAFF REQURIED
 COST OF DATA CONVERSATION
 HIGH HARDWARE COST
 DATABASE FAIILURE
 HUGE SIZE
 CORRUPTION IN FILE
 UPGRADATION IN FILE

6. USERS/ PRGRAMMERS
APPLICATIONPROGRAMS/QUENIES
SOFTWARE TO PROCESS QUERIES PROGRAMS
SOFTWARE TO ACESS STORED DATA
STORED DATABASE
DEFINATION
STORED DATABASE

7.  SO IN GENERAL ,USERSCAN
CREATEPROGEAMMS OR QUERIESDBMS USE
THE DATABASE STOREDON STORAGE
DEVICES AND GIVES MEANINGFUL
INFORMATION
 THE DATABASE SYSTEM IS ILLUSTRATEDIN
THE
 THEMAIN OBJECTIVE OF DBMSIS TO PROVIDE
A CONVEINENT AND EFFECTIVE METHOD OF
DEFNING, STORING RETRIEVING AND
MANUPLATING THE DATA CONTAINED IN
DATABASE
 THERE ARE MANY DBMS LIKE
MYSQL,POSTRGASQL.

8. NAÏVE USERS / APPLICATION USERS / SOPHISTICATED USERS
/DATABASEADMINISTRATER/
APPLICATION
INTERFACT
APPLICATION
PROGRAMS
OVERY TOOLS
DATA
SCHEME
APPLICATION
PROGRAMES
OBJECT CODE EMBEDDEDDML
PRECMPILER DMLCOMPILER
OVERY
PROCES
SOR
TRANSCATI
ON
MANAGER
OVERY
EVALUATION
VALUE
FILE MANAGER
AUTHORIZATION
AND
INTEGREITY
MANAGER
DATA FILES
INDICES STASTICAL DATA
DATA
DICTIONARIES

9.  NATIVE USER
 APPLICATION USER
 SOPHISTICATED USER
 SPECIALIZED USER
 ONLINE USER

10.  WHO NEED TO BE AWAREOF THE
PRESENCEOF DBMS
 THESE ARE END USRES WHO WORK
THROUGH MENU DRIVEN APPLICATION

11.  IT IS RESPONSIBLE FOR DEVELOPING
APP PROGOR USER INTERFACE: WHICH
IS WRITTENBY HIGH LEVEL.

12.  THEY INTERACT WITH THE SYSEM
WITHWRITING THE PROGRAMM THEY
REQUEST IN OVERY LANGUAGE.

13.  THERE ARE TWO TYPESOF FILE
 PHYSICAL FILE
 LOGICAL FILE
 PHYSICAL FILE- IT IS VEIWED IN TERMS
OF HOW THE FILR IS STORED.
 LOGICAL FILE - IT IS VEIWED IN THE
TERMS OF HOW THE FILE IS VEIWED.

14.  HEAP FILE - IS ALSO CALLED AS
UNSOTED FILE.
 SORTED FILE- TO ORGANIZE DATA
 INDEX- EASY TO ACESS

16.  PC BASED SMALL SYSTEM MINI FRAME IS BASED ON
LARGE
RELATIVELY CHEAP SYSTEM
 SINGLE USER SYSTEM EXPENSIVE
 MORE NUMBER USED
 DATA REDUNDANCY AND MULTIPLE USER SYSTEM
INCONSITENCY OCCUR. DATA IS INDEPENDENT AND
NON
 DATA ACESS IS DIFFICULT REDUCANT
 DATA IS ISOLATED CURRENT ACESS TO DATA ACESS IS EFFICENT
 FILE IS NOT POSSIBLE. DATA IS INTEGRATED
 SECURITY PROBLEM. CONCURRENT ACESS AND
 LITTLE PREELIMINARY DESIGN CRASH RECOVERY
EXAMPLE C++,COBOL,VB BETTER SECURITY
 FILE SYSTEM DATA SHARINGIS NOT POWERFUL VAST PERLIMINARY
DESIGN
 AS DBMS EXAMPLE MS ACESS
 TEANSACTION CONCEPT IS NOT USED

17.  THANKYOU