Full width home advertisement

How To

Science

Post Page Advertisement [Top]


What is Hashing in DBMS?

Hashing is a method used to calculate the direct location of a data record on the disk without using index structure. In the situation of a huge database structure, It will be impossible to search all the index values through all its level and then reach the destination data block to retrieve a file or data.

What is Static Hashing in DBMS?

During static hashing, when a search-key value is provided, the hash function always calculates the same address. 

Operation in Static Hash:
1. Insertion: When a record, file or data is to be entered using static hash.

2. Search: When a record needs to be retrieved or located.

3. Delete: This is a search followed by a deletion operation.

What is Dynamic Hashing?

Dynamic hashing or extended hashing provides a method in which data buckets are added and removed dynamically and on-demand, of which usually generate a large number of values.

No comments:

Post a Comment

Bottom Ad [Post Page]

| Designed by Colorlib