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

State the meaning of object representation, State the meaning of Object Rep...

State the meaning of Object Representation  The term object representation means "to represent object with the help of objects model symbols". Implementing objects is too simp

Define null value, Define NULL value NULL value NULL means something is...

Define NULL value NULL value NULL means something is unknown. It does NOT mean null (the digit 0). Null is as well employed as attribute value for a particular entity in which

Data base design for a museum information system, In this practical assignm...

In this practical assignment, we will run through a complete database application development cycle, starting with the schema design, from an initial data import to database applic

Student, explain exhausitively the problems associated with er diagrams wit...

explain exhausitively the problems associated with er diagrams with ellustrations

N-ary relationship, For every n-ary relationship type R where n>2, we make ...

For every n-ary relationship type R where n>2, we make a new table S to represent R. We contain as foreign key attributes in s the primary keys of the relations that show the parti

Difference between internal tables and extra datasets, What is the differen...

What is the difference between internal tables and extract datasets? The lines of an internal table always have the similar structure. By using extract datasets, you can ha

What are the benefits of prepared statements, What are the benefits of prep...

What are the benefits of prepared statements and place holders? Parameter binding operations automatically handle escaping of characters Encourage Statement reuse

Describe the composite key, Describe the Composite Key Composite Key: ...

Describe the Composite Key Composite Key: Sometimes one key is not enough to uniquely recognize a row. E.g. in a single class Roll is enough to search a student, but in the w

Explain the shadow paging recovery technique, Explain the shadow paging rec...

Explain the shadow paging recovery technique.  Ans: Shadow paging is a method used to acquire atomic and durable transactions, and provides the capability to manipulate pages i

Define the term- actors and data stores, Define the term- Actors and Data...

Define the term- Actors and Data Stores Actors: An actor is the active object which drives data flow graph by producing or consuming values. Actors are attached to inputs a

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