What is a hashing function, Database Management System

Assignment Help:

What is a hashing function?  What are the properties of a good hashing function?  Describe the folding technique for hashing functions.    

 Ans:  Hashing function is a method to store a file on the disk. A hash function is a function which while applied to a value of a record (hash field) gives a hash value that is the address of the disk block where the record is stored.

   The properties of a good hash function are like this:

  • It must be easy to evaluate.
  • The hash value acquired should be within the range of valid addresses for a given file.
  • The hash values should be consistently distributed over the range of addresses so that the collisions are minimum.

Folding method for hashing functions:  It includes applying an arithmetic function like addition or a logical function such as exclusive OR to different parts of a hash field to compute the hash addresses. For instance, the numeric hash field can be split into start, middle and end regions, like that the sum of the lengths of the start and end regions equivalents the length of the middle region. The start, middle and end regions' digits are added to acquire a new value, x. After that x mod s, where s is the upper limit for the hash function, provides the hash value.


Related Discussions:- What is a hashing function

Physical records, Physical Records These are the records that are store...

Physical Records These are the records that are stored in the secondary storage devices. For the database relation, physical records are the group of fields kept in adjacent me

Maping constraits, #question.what is mapping constraints and types?.

#question.what is mapping constraints and types?.

Explain controlled redundancy, Explain controlled redundancy? Controll...

Explain controlled redundancy? Controlled redundancy : The replication of data within the data warehouse for the purposes of improved data access or understand ability.

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

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

Explain projection operation distribute over union operation, Illustrate th...

Illustrate the statement 'Projection operation distributes over the union operation'. Give an example.    Ans: Π L (E 1 ∪ E 2 ) = (Π L (E 1 )) ∪ (Π L (E 2 ))   This says th

Define the division operation of relational algebra, Define the Division Op...

Define the Division Operation of Relational Algebra Let R be a relation comprising attributes (A1,...Ap,Ap+1,...An) and S comprising attributes (Ap+1,...An)  DEF: Division

DISTIBUTED DATABASE, Define physical image of a global relation at a site

Define physical image of a global relation at a site

Objectives-transactions and concurrency management, Objectives After Re...

Objectives After Reading this part, you should be able to: Explain the term CONCURRENCY; Describe the term transaction and concurrent transactions; Talk about co

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