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

Concurrent transactions-backup and recovery, Representing complex relations...

Representing complex relationship among data A database may contain varieties of data interrelated to each other in numerous ways. A DBMS must have the capability to represent

Describe entity referential integrity and integrity, Describe entity refere...

Describe entity referential integrity and integrity. Give an example of each. Entity Integrity Rule - If there is a attribute A of relation R is a prime attribute of R then A

What are segments in oracle, What are segments in oracle? Segments - Ea...

What are segments in oracle? Segments - Each table has single field of disk space, known as segment, set aside for it in the tablespace. Segments consist of contiguous sections

Decomposition, properties of derirable decomposition

properties of derirable decomposition

Write short notes on domain relational calculus, Write short notes on domai...

Write short notes on domain relational calculus   The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole

ER Diagram, Soccer player ER Diagram to Relational database schema

Soccer player ER Diagram to Relational database schema

Define hash files organization, Define Hash files organization a. Hashi...

Define Hash files organization a. Hashing includes computing the address of a data item by calculating a function on the search key value.   b. A hash function h is a functi

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

Write short notes on transaction state, Write short notes on transaction st...

Write short notes on transaction state? A transaction may not always complete its implementation successfully such a transaction is termed aborted A transaction must be 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