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

Explain sequential file organization, Question 1 What do you mean by datab...

Question 1 What do you mean by database management system? Question 2 Write a note on Object-Oriented Model Question 3 Explain Sequential File Organization Question

What is a primary index, What is a primary index? A primary index is an...

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

Write short notes on schema diagram, Write short notes on Schema diagram.  ...

Write short notes on Schema diagram.  A database schema along with primary key and foreign key dependencies can be depicted pictorially by schema  diagram. Every relation appea

On laod, how to write a in a text and load it on mysql

how to write a in a text and load it on mysql

What is functional dependency, What is Functional Dependency? A Functi...

What is Functional Dependency? A Functional dependency is shown by X Y among two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple

Why dml is used for, Why DML is used for? DML is used to Manipulation and...

Why DML is used for? DML is used to Manipulation and processing of database. DML is provided for manipulation & processing of database. (Data stored in the database is processed

What is candidate key, What is Candidate Key Super Key or Candidate Ke...

What is Candidate Key Super Key or Candidate Key: It is such an attribute of a table that can uniquely recognize a row in a table. Generally they have unique values and can n

Define the boyce-codd normal form, Define the Boyce-Codd Normal Form with i...

Define the Boyce-Codd Normal Form with instance and also Compare BCNF and 3NF.  Ans: BCNF: For each functional dependency X->Y in a set F of functional dependencies over relati

Define data independence, Data independence seems that "the application is...

Data independence seems that "the application is independent of the access strategy and storage structure of data". In other words, the ability to change the schema definition in o

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