DBMS 1
DBMS 1
Security DBMS provides a good protection It isn't easy to protect a file under the
and mechanism. file system.
Protection
Recovery DBMS provides a crash recovery The file system doesn't have a crash
Mechanism mechanism, i.e., DBMS protects mechanism, i.e., if the system crashes
the user from system failure. while entering some data, then the
content of the file will be lost.
Concurrency DBMS takes care of Concurrent In the File system, concurrent
Problems access of data using some form access has many problems like
of locking. redirecting the file while
deleting some information or
updating some information.
Where to use Database approach used in large File system approach used in
systems which interrelate many large systems which interrelate
files. many files.
Cost The database system is The file system approach is
expensive to design. cheaper to design.
Data Redundancy Due to the centralization of the In this, the files and application
and Inconsistency database, the problems of data programs are created by
redundancy and inconsistency different programmers so that
are controlled. there exists a lot of duplication
of data which may lead to
inconsistency.
One-to-One
One-to-Many
Many-to-One
Many-to-Many
Generalization and specialization are the Enhanced Entity
Relationship diagram (EER-diagram)
It organizes records to one another through It organizes records in form of table and
links or pointers. relationship between tables are set using
common fields.
In this relationship between various records is In this relationship between various records is
represented physically via linked list. represented logically via tables.
There is lack of declarative querying facilities. It provides declarative query facility using SQL.
Complexity increases burden on programmer As physical level details are hidden from end
for database design as well as data users so this model is very simple to
manipulation. understand.
Network Data Model Relational Data Model
Retrieval algorithms are complex but symmetric. Retrieval algorithms are simple and symmetric.
There is partial data independence in this model. This model provides data independence.
There is no inconsistency problem in updating the records The updating of records is quite easy because of the normalization
because of the single instance of the child records. which is used to remove the redundancy in the relations.
Searching for a record is easy in the network model as there In the relational model, a unique, indexed key serves the purpose of
are multiple access paths to reach data item. searching a record.