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

C PROBLEMS, how to solve the C type problems?

how to solve the C type problems?

Differance between ddl and sdl, Differance between DDL and SDL? DDL and...

Differance between DDL and SDL? DDL and SDL - The data definition language (DDL) is used through DBA and database designers to describe internal schema, conceptual schema, and

Explain the process-oriented decomposition, Breaking into Subsystems D...

Breaking into Subsystems Decomposition is a significant technique for coping with complexity based on idea of divide and conquers. In dividing a problem into sub problems, the

What is data model, A Data Model in software engineering is an abstract...

A Data Model in software engineering is an abstract model that organizes and documents the business data for interaction between team members and is used as a plan for creating

Secondary indexes, Secondary Indexes Let consider the student database ...

Secondary Indexes Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

What is asterisk in sql, What is Asterisk in SQL? Asterisk (*): In SQL,...

What is Asterisk in SQL? Asterisk (*): In SQL, the columns for all the tables and views in the FROM clause will be displayed.

What are the technique to define a schema completely, What are the techniqu...

What are the technique to define a schema completely ? A schema is completely define by DDL and DML query language.

What are the object-oriented approaches, What are the object-oriented appro...

What are the object-oriented approaches Software systems which are designed with structured design methodology never support some of desired quality attributes for example reus

Determine the derived attribute to avoid re-computation, Determine the Deri...

Determine the Derived attribute to avoid re-computation Each class box consists of an ordered list of attributes and operations, each represented as a next string. We can find

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