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

Explain the five levels of capability maturity models, Question 1 What is ...

Question 1 What is data mining? Write Data Mining applications Question 2 What is OLAP? Write the benefits of OLAP Question 3 What is Business Intelligence? Explai

Explain the difference between drop and delete, Explain the Difference betw...

Explain the Difference between DROP and DELETE DELETE deletes one or more than one tuples of a particular relation from the database. DROP is employed to remove a table from th

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

What is the meaning of redundant associations, Adding Redundant Association...

Adding Redundant Associations for Efficient Access The expression redundant association means using "duplicate association for proficient access". While analysis, it is not a

Related Rates, All edges of a cube are expanding at a rate of 6 centimeters...

All edges of a cube are expanding at a rate of 6 centimeters per second. How fast is the surface area changing when each edge is (a) 2 centimeters and (b) 10 centimeters?

Use inheritance as an implementation technique, Use inheritance as an imple...

Use inheritance as an implementation technique when you are going to use inheritance as an implementation technique, you can achieve same goal in a safer way by making one cla

Note gate, i want notes on this topic

i want notes on this topic

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

Basic set operation, These are the binary operations; i.e., each is applied...

These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R

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