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 about primary key, Explain about primary key Primary Key: It ...

Explain about primary key Primary Key: It is one of the candidate keys that are taken to be the recognizing key for the entire table. E.g. although there are two candidate ke

Explain the concept of modeling with objects, Explain the concept of Modeli...

Explain the concept of Modeling With Objects A model is a conceptual representation of a specification, design or system from a particular point of view. A modelling language

Attributes, Attributes and its types explain?

Attributes and its types explain?

Identification of concurrency, Identification of concurrency Identifica...

Identification of concurrency Identification of concurrency: Dynamic model identifies concurrency. Two objects are said to be parallel (concurrent) if they can receive events a

Explain the fundamental concepts of object-orientation, Explain the Fundame...

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Explain about database system structure, Explain about database system stru...

Explain about database system structure? Storage manager Authorization and integrity manager Transaction manager File manager Buffer manager Storage manager

What is system log, What is system log? What are the entries? An...

What is system log? What are the entries? Ans: The system log that is generally written on stable storage contains the redundant data required to recover from volatile

Order by clause-data manipulation language, Order by clause By usin...

Order by clause By using this rows can be sorted It is used in the last portion of select statement By default it gets ascending order DESC: is used

Relation schema for student, Example RELATION SCHEMA for STUDENT: STU...

Example RELATION SCHEMA for STUDENT: STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

Database manager, Database Manager It is the interface among low-leve...

Database Manager It is the interface among low-level data, queries and application programs. Databases typically need a large amount of storage space. It is kept on disks, as

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages