Scribd
Upload
51 views6 pages

DBMS Notes

The document discusses the advantages of database management systems (DBMS) over traditional file processing systems. A DBMS removes data redundancy, allows for efficient data retrieval and access, maintains data integrity through constraints, and enables concurrent access by multiple users. However, DBMS can be complex, costly to implement and maintain, and damage to part of the database can affect the entire system. Traditional file systems, on the other hand, suffer from data redundancy, inconsistency, difficulty of access, isolation issues, and lack of integrity and security. The document also covers database concepts such as various data models, languages, independence, and types of users.

Uploaded by

Akshata Chopade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
51 views6 pages

DBMS Notes

The document discusses the advantages of database management systems (DBMS) over traditional file processing systems. A DBMS removes data redundancy, allows for efficient data retrieval and access, maintains data integrity through constraints, and enables concurrent access by multiple users. However, DBMS can be complex, costly to implement and maintain, and damage to part of the database can affect the entire system. Traditional file systems, on the other hand, suffer from data redundancy, inconsistency, difficulty of access, isolation issues, and lack of integrity and security. The document also covers database concepts such as various data models, languages, independence, and types of users.

Uploaded by

Akshata Chopade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

ADVANTAGES OF DBMS OVER FILE PROCESSING ::

1. REMOVES DATA REDUNDANCY.


2. RETRIEVE THE DESIRED DATA.
3. DATA CAN BE ISOLATED IN SEPARATE TABLES.
4. DATA CAN BE ACCESSED EFFICIENTLY.
5. DATA INTEGRITY IS MAINTAINED---CONSTRAINTS.
6. ATOMICITY OF DATA CAN BE MAINTAINED.
7. CONCURRENT ACCESS TO MULTIPLE USERS USING SYNCRONIZATION.
8. SECURITY IS MAINTAINED IN DATABASE.

DISADVANTAGES OF DBMS ::
1. COMPLEX DESIGN , DIFFICULT AND TIME CONSUMING.
2. HARDWARE AND SOFTWARE COST.
3. DAMAGED PART – ENTIRE DATABASE IS AFFECTED.
4. CONVERSION COST
5. TRAINING

DISADVANTAGES OF TRADITIONAL FILE MANAGEMENT SYSTEM ::


1. DATA REDUNDANCY
2. DATA INCONSISTENCY
3. DIFFICULTY IN ACCESSING DATA
4. DATA ISOLATION
5. INTEGRITY PROBLEMS
6. ATOMICITY PROBLEMS
7. CONCURRENT ACCESS ANOMALIES
8. SECURITY PROBLEMS

APPLICATIONS OF DATABASE ::
1. ACCOUNTING
2. MANUFACTURING
3. UNIVERSITIES
4. RESERVATION SYSTEMS
5. BANKING
6. TELECOMMUNICATION

DATA ABSTRACTION ---- PHYSICAL LEVEL


LOGICAL LEVEL
VIEW LEVEL
PHYSICAL LEVEL :: DESCRIBES HOW THE DATA I STORED LOWEST LEVEL OF ABSTRACTION

THIS LEVEL DECIDES COMPLEX LOW LEVEL DATA STRUCTURES.


LOGICAL LEVEL :: DESCRIBES THE RELATIONSHIPS BETWEEN THE DATA

PROGRAMMER AND DBAs WORKS ON THIS LEVEL.

VIEW LEVEL :: HIGHEST LEVEL OF ABSTRACTION.

PROVIDE ACCESS TO ONLY THE PART OF THE DATABASE.

THIS LEVEL HELPS IN SIMPLIFYING THE INTERATIONS WITH THE SYSTEM.

PROVIDES MULTIPLE VIEW OF SINGLE DATABASE.

DATABASE LANGUAGES ::
DATA DEFINATION LANGUAGE (DDL) –
CREATE,ALTER,DROP.TRUNCATE,RENAME
LANGUAGE USED FOR CREATING AND MODIFYING THE STRUCTURES OF TABLES , INDEXES ,
AND VIEWS .
DATA MANIPULATION LANGUAGE (DML) –
INSERT , UPDATE , DELETE
ENABLE USERS TO ACCESS OR MANIPULATE DATA AS ORGANIZED BY APPROPRIATE DATA
MODEL .
DML :

 PROCEDURAL – REQUIRE A USER TO SPECIFY WHAT DATA IS NEEDED AND HOW TO


GET THAT
 DECLARATIVE – REQUIRE USER TO SPECIFY WHAT DATA IS NEEDED WITHOUT
SPECIFYING HOW TO GET THAT
DATA CONTROL LANGUAGE (DCL) – CONTROLS ACCESS TO THE DATABASE
GRANT- USE TO IVE ACCESS RIGHTS OR PRIVILEGES TO THE DATABASE
REVOKE – REMOVES USER ACCESS RIGHTS
DATA TRANSFER LANGUAGE (DTL) – rollback , commit
ARCHITECTURE OF DBMS ::
THREE SCHEMA ARCHITECTURE –

 INTERNAL SCHEMA
PHYSICAL STORAGE STRUCTURE OF DATABASE
THIS SCHEMA IS MAINTAINED BY SOFTWARE AND USERS ARE NOT ALLOWED
TO MODIFY IT .
It typically describes the record layout of the files and types of files, access paths etc.
 CONCEPTUAL SCHEMA
This schema hides the details of internal level.
This level is also called as logical level as it contains the constructs used for designing
the database.

 EXTERNAL SCHEMA
USER VIEW
CAN SEE DATA STORED IN DATABASE BUT CANT SEE HOW IT IS STORED.

Q. Different components of database management systems like query processor, storage


manager, transaction manager etc. are functional for processing the query submitted by
user. Explain the functions of each component in view of getting query output. 28

DATA MODELS ::
1. RELATIONAL MODEL
ADV -
 Structural independence
 Conceptual simplicity
 Query capability
 Easy design, maintenance and usage
DISADV
 requires powerful hardware
 slower processing time
 poor implementation

2. ENTITY-RELATIONSHIP MODEL
DISADV
 Loss of information
 Limited relationships
 No representation for data manipulation
 No industry standard

3. OBJECT-BASED DATA MODEL – object oriented features with relational data model

ADV --
 Enriched modelling
 Reusability
 Support for schema evolution
 Improved performance

DISADV --

 Lack of universal data model


 Lack of experience
 Complex

4. SEMI-STRUCTURED DATA MODEL –


o permits the specification of data where individual data items of same type may have
different sets of attributes.
o The Extensible Markup Language (XML) is widely used to represent semistructured data
model.

ADV --
 Data is not constrained by fixed schema.
 It is flexible.
 It is portable.

DISADV --

 Queries are less efficient than other types of data model.

5. HIERARCHIAL DATA MODEL –


RELATIONSHIP OF 1:N IS MAINTAINED.
DISADV –
 Traversing through each node is required.
 It fails to handle many to many relationship (M : N) efficiently.
 It can cause duplication and data redundancy.

6. NETWORK MODEL --
IT HELPS TO ADDRESS M:N RELATIONSHIP

ANY CHILD CAN HAVE MULTIPLE PARENTS

THE MAIN DIFFERENCE BETWEEN NETWORK MODEL AND HIERARCHICAL MODEL IS TO ALLOW
MANY TO MANY RELATIONSHIP.

ADV
 Capability to handle more Relationships
 Ease of data access
 Data Integrity
 Conformance to Standards
DISADV
 Complex to implement
 Complicated Operations
 Difficult to change structure

DATA INDEPENDENCE ::

 BY THIS TIME AND COST CAN BE REDUCED FOR MAKING CHANGES


 ABSTRACT VIEW OF DATA CAN BE PROVIDED TO USER
DATA INDEPENDENCE IS AN ABILITY BY WHICH ONE CAN CHANGE THE DATA AT ONE LEVEL
WITHOUT AFFECTING THE DATA AT ANOTHER LEVEL. HERE LEVEL CAN BE PHYSICAL,
CONCEPTUAL OR EXTERNAL.
THE STRUCTURE OF THE DATABASE OR THE VALUES STORED IN THE DATABASE CAN BE
EASILY MODIFIED BY WITHOUT CHANGING THE APPLICATION PROGRAMS.
---- PHYSICAL INDEPENDENCE :
allows the modification of physical schema without requiring any change to the conceptual schema.

For example - if there is any change in memory size of database server then it will not affect the
logical structure of any data object.
---- LOGICAL INDEPENDENCE :
allows the modification of conceptual schema without requiring any change to the external schema.
For example - Any change in the table structure such as addition or deletion of some column does
not affect user views.

DATABASE USERS :: NAÏVE USERS


APPLICATION PROGRAMMERS
SOPHISTICATED USERS
SPECIALIZED USERS

You might also like