Describe hashing in dbms, Database Management System

Assignment Help:

Describe Hashing in DBMS?

Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1)). For this every record requires an unique key.

The primary idea is not to find for the correct position of a record along with comparisons but to compute the position inside the array. The function which returns the position is known the 'hash function' and the array is called a 'hash table'.


Related Discussions:- Describe hashing in dbms

What is oracle process explain for processes of oracle, What is Oracle Proc...

What is Oracle Process? Explain any four processes started by Oracle. Oracle Process is as follows: SMON: The System Monitor carries out a crash recovery while a crashed in

Find a 3nf decomposition , Find a 3NF decomposition of the following relati...

Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following

Extend the database, Now that she understands more about the benefits of da...

Now that she understands more about the benefits of databases, the play-scheme manager would like to extend the play-scheme database to include data for schools and instructors as

Give an example of enforcement in typing, Give an example of enforcement in...

Give an example of enforcement in Typing. You can understand the idea of enforcement as it makes sure objects of dissimilar classes may not be interchanged as below:  Exampl

RDBMS, why data in an RDMS need to be normalised

why data in an RDMS need to be normalised

Data manipulation language, Question 1 Discuss about second normal form an...

Question 1 Discuss about second normal form and third normal form Question 2 Write short note on                        1) Data Manipulation Language 2) Data Definition La

Describe the nested-loop join and block-nested loop join, Describe the nest...

Describe the nested-loop join and block-nested loop join.   Ans:   The block nested- loop join algorithm is as described below:     for every block B r of relation R do beg

Define an abstraction, Define an abstraction by which relationships are tre...

Define an abstraction by which relationships are treated as higher level entities Ans: Aggregation.  It is an abstraction by which relationships are treated as higher level

Define redo logs, Redo Logs: Any database must have minimum two redo logs....

Redo Logs: Any database must have minimum two redo logs. These are the rules for the database; the redo logs record all modifies to the system objects or user objects. If any type

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