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 odbc, What is ODBC ? ODBC - Open DataBase Connectivity which i...

What is ODBC ? ODBC - Open DataBase Connectivity which is also denoted by ODBC enable the integration of SQL along with a common-purpose programming language. ODBC expose data

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

What is the function of a domain, What is the function of a Domain? A d...

What is the function of a Domain? A domain defines the technical settings of a table field. A domain describes a value range, which sets the permissible data values for the

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

What is the archtetype pattern, What is the archtetype/instance pattern? ...

What is the archtetype/instance pattern? The archetype/instance pattern happens when one entity tracks occurrences of another entity. A common example is the relationship among

Describe the storage structure of indexed sequential file, Describe the sto...

Describe the storage structure of indexed sequential files and their access method. Ans: Index offers a lookup capability to rapidly reach the vicinity of the desired record.

Short note on mid square method of hashing, Short Note on mid Square Method...

Short Note on mid Square Method of hashing? Mid square method of hashing: In the method midsquare hashing, the key is squared and the address selected from the center of the s

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

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