Question

discuss various types of file organizations ?
​

Answer 1

Answer:

Various methods have been introduced to Organize files. These particular methods have advantages and disadvantages on the basis of access or selection . Thus it is all upon the programmer to decide the best suited file Organization method according to his requirements.

Some types of File Organizations are :

Sequential File Organization

Heap File Organization

Hash File Organization

B+ Tree File Organization

Clustered File Organization

Sequential File Organization –

The easiest method for file Organization is Sequential method. In this method the file are stored one after another in a sequential manner.

Pros and Cons of Sequential File Organization –

Pros –

Fast and efficient method for huge amount of data.

Simple design.

Files can be easily stored in magnetic tapes i.e cheaper storage mechanism.

Cons –

Time wastage as we cannot jump on a particular record that is required, but we have to move in a sequential manner which takes our time.

Sorted file method is inefficient as it takes time and space for sorting records.

Heap File Organization –

Heap File Organization works with data blocks. In this method records are inserted at the end of the file, into the data blocks. No Sorting or Ordering is required in this method. If a data block is full, the new record is stored in some other block, Here the other data block need not be the very next data block, but it can be any block in the memory. It is the responsibility of DBMS to store and manage the new records.

Pros and Cons of Heap File Organization –

Pros –

Fetching and retrieving records is faster than sequential record but only in case of small databases.

When there is a huge number of data needs to be loaded into the database at a time, then this method of file Organization is best suited.

Cons –

Problem of unused memory blocks.

Inefficient for larger databases.

Hash File Organization

In database management system, When we want to retrieve a particular data, It becomes very inefficient to search all the index values and reach the desired data. In this situation, Hashing technique comes into picture.

Hashing is an efficient technique to directly search the location of desired data on the disk without using index structure. Data is stored at the data blocks whose address is generated by using hash function. The memory location where these records are stored is called as data block or data bucket.