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

Write query to insert data in student table, Consider student (std_id, std_...

Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328

Define the term- control as state within program, Control as State within P...

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

Explain displaying an er schema as an er diagram, Explain the conventions f...

Explain the conventions for displaying an ER schema as an ER diagram? An E-R Diagram scheme might describe certain constraints to that the contents of a database must conform.

Define the one-way associations, One-way Associations When an associat...

One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

What is abstraction, What is abstraction? Abstraction in the object ori...

What is abstraction? Abstraction in the object orientation is a idea that provide opportunity to express necessary properties of object without providing much details of the im

Determine the method of choosing algorithms, Determine the method of Choosi...

Determine the method of Choosing Algorithms In general, most of operations are easy and have a satisfactory algorithm since description of what is to be done also shows how i

B+ tree, construct a B+ tree for the following set of key value (2,3,5,7,11...

construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh

Explain stand alone query language in details, Explain Stand Alone Query La...

Explain Stand Alone Query Language in details? Stand alone Query Language - The query language that can be used interactively is known as stand alone query language. It does no

Partial relation emp-get the details people with min salary, Let consider t...

Let consider the given partial relation EMP. Let us make some sub-queries for them EMPNO ENAME JOB SAL DEPTNO 7566

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