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

Define object-oriented database, Question : Object-Oriented Database (O...

Question : Object-Oriented Database (OODM) is defined as a logical data model that captures the semantics of objects supported in object-oriented programming. An Object-Oriente

Oracle, comparison of oracle RDBMS with MySQL

comparison of oracle RDBMS with MySQL

Generalization and specialization, design a generalization specialization h...

design a generalization specialization hierarchy for a motor vehicle sales company. the company sells motorcycles, passenger cars, vens and buses.

What does the cardinality ratio specify, What does the cardinality ratio sp...

What does the cardinality ratio specify? Mapping cardinalities or cardinality ratios state the number of entities to which another entity can be associated. Mapping cardinaliti

Want massive amount of products imported through csv, OPENCART - Want Massi...

OPENCART - Want Massive amount of products Imported through CSV We have a massive list of products that would take completely too long to do data entry. We require a slick progr

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

How to apply the bcnf decomposition , Consider the following relational sch...

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Recovery management component, Ask question #Minim 100 words accepted#what ...

Ask question #Minim 100 words accepted#what is recovery management component in database management system and how it is useful

Example of ancestry database , Ancestry database records information about ...

Ancestry database records information about family trees . Following information is recorded about each person: FIRSTNAME first name SURNAME surname MNAME maiden name (if

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