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

Create a table to record a passengers information, Given the following rela...

Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No

Purchase orber , Run the following queries. For each query show 1) What yo...

Run the following queries. For each query show 1) What you expect the output to be based upon the data 2) the SQL code and 3) the output running the query in Oracle. 1. Show all c

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);

What is the difference between serial and sequential files, What is the dif...

What is the difference between serial and sequential files? How searching is applied on both?    Ans: A serial file is one where the records have been stored in the order where

Database models, why are older data models are being replaced by new data m...

why are older data models are being replaced by new data models

What are the various states of transaction process, What are the various st...

What are the various states through which a transaction passes through in its lifetime?  Briefly discuss all the events that causes transition from one state to another.   Ans:

Lack of redundancy, Lack of Redundancy We have talked about the problems o...

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

What is called an evaluation primitive, What is called an evaluation primit...

What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.

Relational database integrity, A database is a set of data. But, is the dat...

A database is a set of data. But, is the data kept in a database trustworthy? To answer that query we must first answer the question. What is integrity? Integrity simply means t

Determine the persistent object, Determine the Persistent object Persis...

Determine the Persistent object Persistent object can be stored in one of the following: Files Cheap, permanent, simple storage Low level (Write, Read) Ap

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