2 Feb 2020

  • February 02, 2020
  • Amitraj
Hash or Direct File Organization


Hash File Organization uses the computation of hash function on some fields of the records. The hash function's output determines the location of disk block where the records are to be placed.







-> When a record has to be received using the hash key columns, then the address is generated, and the whole record is retrieved using that address. In the same way, when a new record has to be inserted, then the address is generated using the hash key and record is directly inserted. The same process is applied in the case of delete and update.


-> In this method, there is no effort for searching and sorting the entire file. In this method, each record will be stored randomly in the memory.












Pros Of Hash / Direct / Random File Organization -

1. Records can be immediately accessed for updation.

2. Several files can be simultaneously updated during transaction processing.

3. Transaction need not be sorted.

4. Existing records can be modified.




Cons Of Hash File Organization -

1. Special backup and reconstruction procedures must be established.

2. Less efficient use of storage space.

3. Expensive hardware and software are required.

4. High complexity in programming.

5. File updation is more difficult when compared to that of sequential method.

Related Posts:

  • B+ Tree In DBMS B+ Tree -> The B+ tree is a balanced binary search tree. It follows a multi-level index format. -> In the B+ tree, leaf nodes denote actual data pointers. B+ tree ensures that all leaf nodes remain at the same height… Read More
  • B+ Tree index files | B Tree index files B+ Tree index files -> Above concept of B+ tree is used to store the records in the secondary memory. If the records are stored using this concept, then those files are called as B+ tree index files.  Since this tr… Read More
  • DBMS Dynamic Hashing Dynamic Hashing -> The dynamic hashing method is used to overcome the problems of static hashing like bucket overflow. -> In this method, data buckets grow or shrink as the records increases or decreases. This method… Read More
  • Indexing in DBMS : Primary, Secondary, Clustering, Multilevel Indexing in DBMS Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed. The index is a type of data structure. It is used to locate and acce… Read More
  • DBMS Static Hashing Static Hashing In static hashing, when a search-key value is provided, the hash function always computes the same address. For example, if mod-4 hash function is used, then it shall generate only 5 values. The output addres… Read More

Translate

Popular Posts