By Topic

On the design of special hash functions for multiple hash tables

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Serrano, E.J. ; Dept. of Automotive Sci., Kyushu Univ., Fukuoka, Japan

One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special hash functions and shows relevant results not just in increasing the probability of no address collision but in reducing the memory for hashing.

Published in:

Electrical Engineering, Computing Science and Automatic Control (CCE), 2012 9th International Conference on

Date of Conference:

26-28 Sept. 2012