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

Which of the operations constitute a basic set of operations, Which of the ...

Which of the operations constitute a basic set of operations for manipulating relational data? Relational algebra operations constitute a basic set of operations for manipulati

Define object oriented model, Object Oriented model :An object has values...

Object Oriented model :An object has values stored in instance variables within the object. An object also has bodies of code that execute on the object. These bodies of code are

What are the responsibility of file manager, What are the responsibility of...

What are the responsibility of File manager? File Manager : Manager allocation of space on disk storage and the data structures used to represent within stored on disk. It is a

Explain about foreign key, What is Foreign Key Foreign Key: Sometimes...

What is Foreign Key Foreign Key: Sometimes we may have to work with an attribute that does not have a primary key of its own. To recognize its rows, we have to use the primar

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

2phase locking, we need example of 2phase locking

we need example of 2phase locking

Explain the disadvantages of creating a temporary table, Explain the disadv...

Explain the disadvantages of creating a temporary table? If you have already created a temporary table with a shown name and attempting to create a second one with that nam

Illustrate the diagram - association as a cache, Association as a cache ...

Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient.    Figure:

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