Usage of DBMS over File Management System: The search operation becomes difficult when a text or binary files contains huge amounts of data. The basic operations like insert data as well as delete data becomes difficult in file management system. DBMS software is designed exclusively to store, search and manipulate huge data amount. The file system may not control data redundancy as each user would define and maintain required files for specific application. DBMS can control redundancy, it stores single data storage that is been accessed by many users. The data sharing facility is difficult in file system. In DBMS data could be shared by centralized system. File system has no provision to stop anomalies. DBMS provides locking system to stop anomalies. File system requires different application programs for each search operation performed. DBMS provides searching operations that are inbuilt. A small query is to be written to retrieve the required data. File system has no provision to check constraints for data integrity. DBMS maintains integrity of data; it enforces constraints on data that are user defined. In file system there is a heavy interdependence between data as well as programs. DBMS provides a separation between data as well as program. In file systems, enforcing security constraints is difficult. In DBMS, with central control over database , database administrator can enforce security constraints. Hence, due to all these advantages most businesses use DBMS to store data instead of text or binary files.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 1SA

Program Plan Intro

Usage of DBMS over File Management System:

The search operation becomes difficult when a text or binary files contains huge amounts of data.

The basic operations like insert data as well as delete data becomes difficult in file management system.

DBMS software is designed exclusively to store, search and manipulate huge data amount.

The file system may not control data redundancy as each user would define and maintain required files for specific application.

DBMS can control redundancy, it stores single data storage that is been accessed by many users.

The data sharing facility is difficult in file system.

In DBMS data could be shared by centralized system.

File system has no provision to stop anomalies.

DBMS provides locking system to stop anomalies.

File system requires different application programs for each search operation performed.

DBMS provides searching operations that are inbuilt.

A small query is to be written to retrieve the required data.

File system has no provision to check constraints for data integrity.

DBMS maintains integrity of data; it enforces constraints on data that are user defined.

In file system there is a heavy interdependence between data as well as programs.

DBMS provides a separation between data as well as program.

In file systems, enforcing security constraints is difficult.

In DBMS, with central control over database, database administrator can enforce security constraints.

Hence, due to all these advantages most businesses use DBMS to store data instead of text or binary files.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…

(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···

(Greedy Algorithms) Describe an efficient algorithm that, given a set {x1, x2, . . ., xn} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. Argue that your algorithm is correct.