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

Which sorting technique is used to sort databases, Which sorting technique ...

Which sorting technique is used to sort databases, whose sizes are very big?  Give one such algorithm.  Why do sorting techniques like quicksort, insertion sort, etc.  not applied

Disadvantages or unsecure, In Database software have only pure security or ...

In Database software have only pure security or some dis secured by administrator?

What is meant by heuristic optimisation, What is meant by heuristic optimis...

What is meant by heuristic optimisation?Discuss the major heuristics that are applied during query optimisation.

External failure-database recovery and security, External failure : A failu...

External failure : A failure can also result because of an external cause, such as earthquakes, fire, floods, etc. The database must be duly backed up to avoid troubles occurring d

Determine set of minimal functional dependency-normalization, 1. Determine ...

1. Determine the set of minimal functional dependencies for the following data. The local bakery, Happy Cakes, needs your help designing a database that will support a kiosk in

Er diatgrams, Ask q“A database will be made to store information about pati...

Ask q“A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded wher

Availability-data replication, Availability: A site having the copy of a r...

Availability: A site having the copy of a replicated relation fails, even then the relation may be found in another site. Therefore, the system may carry on to process at least th

What is called an evaluation primitive, What is called an evaluation primit...

What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.

Functional dependencies and normalization for relational dat, Consider the ...

Consider the 1ollowin8 relation: CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., crui

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

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