Differentiate between static hashing and dynamic hashing, Database Management System

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.

Posted Date: 5/6/2013 3:09:55 AM | Location : United States







Related Discussions:- Differentiate between static hashing and dynamic hashing, Assignment Help, Ask Question on Differentiate between static hashing and dynamic hashing, Get Answer, Expert's Help, Differentiate between static hashing and dynamic hashing Discussions

Write discussion on Differentiate between static hashing and dynamic hashing
Your posts are moderated
Related Questions
Write short note on Data models? Data models: A data model is an abstract model which elaborates how data is represented and accessed. The term data model has two commonly ac

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

What are the states of transaction? The states of transaction are:- a) Active b) Partially committed c) Failed d) Aborted e )Committed   f) Terminated

What Count function return in SQL? Count function within SQL returns the number of values. (Count function counts all the not null values in the exact column. If we need to cou

Define null values. In some cases a certain entity may not have an applicable value for an attribute or if we do not know the value of an attribute for a certain entity. In the

What is a view? How it is related to data independence? A view might be thought of as a virtual table, that is, a table that does not really exist in its own right but is inste

Control as State within Program 1.  The term control exactly means to check effect of input within a program. For illustration, in Figure, after the ATM card is inserted (a

What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.

Need For Distributed Database Systems A distributed database is a set of database kept on multiple computers that appears to applications as a one database. As a result, an app

Explain algorithm of ER To Relational Mapping ? ER-to-Relational Mapping Algorithm: 1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relatio