What are the advantages of file organisation?

Answer 1

Disadvantages of File Processing Systems include:

1. Program-Data Dependence. File descriptions are stored within each application program that accesses a given file.

2. Duplication of Data. Applications are developed independently in file processing systems leading to unplanned duplicate files. Duplication is wasteful as it requires additional storage space and changes in one file must be made manually in all files. This also results in loss of data integrity. It is also possible that the same data item may have different names in different files, or the same name may be used for different data items in different files.

3. Limited data sharing. Each application has its own private files with little opportunity to share data outside their own applications. A requested report may require data from several incompatible files in separate systems.

4. Lengthy Development Times. There is little opportunity to leverage previous development efforts. Each new application requires the developer to start from scratch by designing new file formats and descriptions

5. Excessive Program Maintenance. The preceding factors create a heavy program maintenance load. 6. Integrity Problem. The problem of integrity is the problem of ensuring that the data in the database is accentuate. 7. Inconsistance data 8. Security ---- . The Problem of security in file processing is Non Programmer can retrieve modify, delete and insert the data in data base. But this is not possible in DBMS

Answer 2

The following are drawbacks of file system 1. unlike database system file system cannot create relationships 2. File system doesn't have the very essential ACID properties. 3. File system is time consuming; not more better than manual record keeping systm. 4. Difficulty in retrieval of information and so on by Zemu

Answer 3

When files are in some logical order it becomes trivial to locate individual files. If we imagine a telephone directory (a list of names and telephone numbers where the elements are ordered by name), locating the number for a given name is trivial because we can start in the middle. If that's not the name we're looking for, we can determine whether the name comes before or after the middle element and reduce the number of elements we need to search by half. We repeat the process with the remaining half, gradually reducing the elements by half each time we fail to locate our name. If the remaining half has no elements then the name does not exist, otherwise we will find the name -- and the number we're actually looking for -- relatively quickly. This is known as a binary search because the average time complexity of searching n elements is O(log n), where log n is the binary logarithm of n. If the elements were unsorted, the only way to find the name is to search all the elements linearly (in the order they appear), which has an average time complexity of O(n).

Answer 4

The only disadvantage is the additional time it takes to organise the files. Maintaining the order (when adding new files) also has to be taken into consideration, however the greatest cost is simply in the initial organisation of the files. Once organised, locating the next insertion point is relatively trivial.

Answer 5

Disadvantages of file management include program-data dependence. It also includes limited data sharing, duplication of data, and lengthy development times.

Answer 6

complicated to control redundancy and no security

Answer 7

yah

Answer 8

me and u