Division-remainder hashing, Data Structure & Algorithms

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record.

The choice of suitable divisor may not be so simple. If it is known that the file is to have n records, then we has to, assuming that only one record can be stored at a given address, have divisor n.

Also we might have a very large key space as compared to the address space. Key space refers to every possible key value. The address space possibly may not match in fact for the key values in the file. So, calculated address may not be unique. It is called Collision, that means

R(K1) = R(K2), where K1 = K2.

Two unequal keys have been calculated to have the simialr address. The keys are called as synonyms.

There are several approaches to handle the problem of collisions. One of these is to hash to buckets. A bucket is a space that can suggest multiple records.

Posted Date: 4/11/2013 6:23:25 AM | Location : United States







Related Discussions:- Division-remainder hashing, Assignment Help, Ask Question on Division-remainder hashing, Get Answer, Expert's Help, Division-remainder hashing Discussions

Write discussion on Division-remainder hashing
Your posts are moderated
Related Questions
What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

write a algorithsm in c to perform push and pop operations stastic implementation using array ?

The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c

QUESTION (a) Define a tree and list its properties. (b) By showing all your workings, draw the spanning tree for the following graph based on the Breadth-First-Search algori

In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

What do you mean by complexity of an algorithm? The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space need of the algorithm i