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

Define the query optimisation, Define the Query optimisation The query ...

Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica

Example database application, We will explain here an example database appl...

We will explain here an example database application having COLLEGE database and use it in showing several E-R modelling concepts. College database remains track of faculty, Stu

Queries, Find the names of all Albums that have more than 30 tracks. Result...

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

What is the difference between primary key and a unique key, What's the dif...

What's the difference between a primary key and a unique key? Both primary key and unique key enforces uniqueness of the column on which they are explained. But by default prim

Create a subroutine, 1. Create a subroutine that does the remote blast on t...

1. Create a subroutine that does the remote blast on the file protein.fa. 2. Pass that returned files from the blast to another subroutine that parses the output and sends it to

Relational schema, crete a data base relationship model Entity: ...

crete a data base relationship model Entity: Students; Professors; Dormitories buildings; Attributes of students: Name; Address; Dorm;

Data fragmentation-use of partial data by applications, Use of partial data...

Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather

Write short notes on relational constraints, Write short notes on relationa...

Write short notes on relational constraints? Relational Constraints are: 1. NOT NULL 2. Unique 3. Primary key 4. Foreign key 5. Table check

What are the disadvantages of file processing system, What are the disadvan...

What are the disadvantages of file processing system? The drawbacks of file processing systems are a) Data redundancy and inconsistency b) Complexity in accessing data

Greater potential for bugs and increased processing overhead, Greater poten...

Greater potential for bugs: Since the sites of a distributed system operate simultaneously, it is more complex to ensure the correctness of algorithms. The art of constructing dis

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages