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
Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

Q. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list.  Ans: /* s

Q. Explain the term hashing? Explain any five well known hash functions.                         Ans: Hashing method provides us the direct access of record from the f

calculate gpa using an algorithm

Q. Write down a non recursive algorithm to traverse a binary tree in order.                    Ans: N on - recursive algorithm to traverse a binary tree in inorder is as

Containers Introduction Simple abstract data types are useful for manipulating simple sets of values, such as integers or real numbers however more complex abstract data t

Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text

floyd warshall algorithm

H o w can you r ot a t e a B i n a r y Tr e e? E x pl a i n r i g h t a n d l eft r ot a tion s by taking an e x a mpl e.   If after

Binary search tree. A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: - All keys (if an