Direct file organization is also known as hash file organization. A hash function is calculated in this approach for storing the records – that provides us with the address of the block that stores the record. Any mathematical function can be used in the form of a hash function. It can be straightforward or intricate.
In this article, we will dive deeper into ‘Hash File Organization in DBMS’ according to the GATE Syllabus for (Computer Science Engineering) CSE. Keep reading ahead to learn more.
What is Hash File Organization in DBMS?
Hash File Organization uses the computation of the hash function on some fields of a record. The output of the hash function defines the position of the disc block where the records will be stored.
When a record is requested using the hash key columns, an address is generated, and the entire record is fetched using that address. When a new record needs to be inserted, the hash key is used to generate the address, and the record is then directly placed. In the case of removing and updating, the same procedure is followed.
There is no effort involved in searching and categorising the full file using this method. Each record will be put in the RAM at random using this procedure.
Keep learning and stay tuned to get the latest updates on the GATE Exam along with Eligibility Criteria, GATE Syllabus for CSE (Computer Science Engineering), GATE CSE Notes, GATE CSE Question Paper, and more.
Also Explore,
- Introduction to DBMS
- File Organization in DBMS
- Sequential File Organization in DBMS
- Heap File Organization in DBMS
- Hash File Organization in DBMS
- Cluster File Organization in DBMS
- Transaction in DBMS
- Transitive Dependency in DBMS
- Types of Keys in DBMS
- Anomalies in DBMS
- B+ File Organization in DBMS
- Flat Data Model in DBMS
Comments