February 02, 2020
Amitraj
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. The heap file is also known as an unordered file.
-> In the file, every record has a unique id, and every page in a file is of the same size. It is the responsibility of DBMS to store and manage the new records.
-> 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. The heap file is also known as an unordered file.
-> In the file, every record has a unique id, and every page in a file is of the same size. It is the responsibility of DBMS to store and manage the new records.
Insertion Of a New Record:-
Suppose we have five records R1, R3, R6, R4 and R5 in a heap and suppose we want to insert a new record R2 in a heap. If the data block 3 is full then it will be inserted in any of the database selected by the DBMS, let's say data block 1.
-> If we want to search, update or delete the data in heap file organization, then we need to traverse the data from staring of the file till we get the requested record.
-> If the database is very large then searching, updating or deleting of record will be time-consuming because there is no sorting or ordering of records.
Pros of Heap file organization
1. 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.
2. Fetching and retrieving records is faster than sequential record but only in case of small databases.
Cons of Heap file organization
1. This method is inefficient for large databases.
2. Problem of unused memory blocks.
