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

Determine the steps of path in association network, Determine the steps of ...

Determine the steps of path in association network You can analyse use of paths in association network in the following steps: Examine every operation and see what asso

Cascading rollback, explain cascading rollback

explain cascading rollback

Draw an e_r model in oracle, Draw an E_R Model for the following: An or...

Draw an E_R Model for the following: An organization uses number of items of a equipment to generates goods. Each item is at one LOCATION, of one TYPE and has a DETAILED_DISCRI

Write query to select student from math department, Consider the table stud...

Consider the table student and list names of students in the departments other than maths and computer. SELECT std_name FRM student WHERE dept_name NOT IN (‘Maths','Computer);

Determine the concept of process, Determine the concept of Process Pro...

Determine the concept of Process Process: A process transforms the data values. It is represented as ellipse containing a description of transformation. Each procedure has a

System analysis plannig and control, milestone assignment

milestone assignment

List the drawbacks of relational database system, List the drawbacks of rel...

List the drawbacks of relational database system A) Repetition of data B) Inability to s certain information.

Assignment - 1 - redoing to improve grades, Assignment #1 Data Management ...

Assignment #1 Data Management The questions on this exam are based on the Baxter Aviation case scenario. 1. (5 points) The systems analyst proposes the following two relationshi

Define- relational algebra, Define- relational algebra. The relational ...

Define- relational algebra. The relational algebra is a procedural query language. It having of a set of operations that take one or two relation as input and make a new relati

Define deadlock avoidance, Define Deadlock avoidance These protocols a...

Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages