Explain the dynamic hashing techniques, Database Management System

Assignment Help:

Explain the Dynamic Hashing Techniques

There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identical to indexing. The major difference is that the access structure is based upon the values that the result after application of the hash functions to the search field. The second one is, linear hashing - does not need additional access structures.

Related Discussions:- Explain the dynamic hashing techniques

Question, I want to buy this but I want to see a couple sample questions fi...

I want to buy this but I want to see a couple sample questions first. http://www.expertsmind.com/library/what-happens-to-rms-error-for-the-training-data-set-51564843.aspx

Multi-key file organisation, Multi-Key File Organisation In this part, ...

Multi-Key File Organisation In this part, we will introduce two basic file Organisation schemes that permit records to be accessed by more than one key field, therefore, allowi

Participation constraints, explain participation constraints with examples

explain participation constraints with examples

Primary key, The primary key is selected from the

The primary key is selected from the

What is relational dbms, What is Relational DBMS This is our subject of...

What is Relational DBMS This is our subject of study. A DBMS is relational if the data is organized into relations, that is, tables. In RDBMS, all data are kept in the well-kno

Explain the static or conservative two phase locking, Explain the Static or...

Explain the Static or conservative Two Phase Locking: Static (or conservative) Two Phase Locking: In this type of scheme, all the data items are locked earlier than any opera

Rules of data normalisation, Rules Of Data Normalisation Let us now su...

Rules Of Data Normalisation Let us now summarise Normalisation with the help of various clean rules. The following are the necessary rules for the Normalisation process: 1.

Explain query tree represent relational algebra expression, How does a quer...

How does a query tree represent a relational algebra expression? Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is

Example of transaction? , Example :; transfers transfer_amount from x's acc...

Example :; transfers transfer_amount from x's account to y's account ; Supposes x&y both accounts exist TRANSACTION (x, y, transfer_amount) Start transaction IF X AND Y

Explain dynamic two-phase locking, Explain Dynamic Two-Phase Locking H...

Explain Dynamic Two-Phase Locking Here a transaction locks a data item instantly earlier than any operation is applied on the data item. After finishing all the operations on

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages