Differentiate between static hashing and dynamic hashing, Database Management System

Assignment Help:

Differentiate between static hashing and dynamic hashing. 

Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we require an overflow bucket to store any extra records that hash to the full bucket. This can be completed with a link to an overflow page, or a linked list of overflow pages. The linked list can be separate for every bucket, or similar for all buckets that overflow. While searching for a record, the original bucket is accessed first, after that the overflow buckets. Specified there are several keys that hash to the same bucket, locating a record may need accessing multiple pages on disk that greatly degrades performance. 

The dilemma of lengthy searching of overflow buckets is solved by Dynamic Hashing. In Dynamic Hashing the size of the directory grows along with the number of collisions to accommodate new records and prevent long overflow page chains. Extendible and Linear Hashing are two dynamic hashing methods.


Related Discussions:- Differentiate between static hashing and dynamic hashing

What three major types of actions includes databases, What three major type...

What three major types of actions includes databases? Briefly discuss these The three major types of actions including databases are: (i) Defining: It includes specifyin

What is a primary index, What is a primary index? A primary index is an...

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

What is a primary key, What is a primary key? Primary key is chosen by ...

What is a primary key? Primary key is chosen by the database designer as the principal means of identifying an entity in the entity set.

Data management, Develop a database broker framework to implement a persist...

Develop a database broker framework to implement a persistence mechanism for the domain objects involved in the use case dealt with in Question 2.  a. Specify the attribute type

Data Minnning, Can i get help with weka software

Can i get help with weka software

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Define union compatibility, Define union compatibility? Explain why INTERSE...

Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible? Two relations R(A1, A2,-------, An) and S(B1, B2,--

Transaction, .#question. Discuss the problem which may arise during concurr...

.#question. Discuss the problem which may arise during concurrency control and recovery in distributed database which are not encountered in controlized database environment.

What is dbms and what are functions of dbms, What is DBMS and what are func...

What is DBMS and what are functions of DBMS? DBMS consist of collection of integrated data and set of program to admission those data. The functions performed by a typical

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd