Multiple Hash Tables for Skewed Sets of Integer Keys

摘要

One drawback in bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory in hash tables for skewed sets of keys. We look at key conversion and multiple hash tables in tradeoff with processing for reducing address collisions and chaining, and accommodating more states in the memory space. This paper presents relevant preliminary results in the quest of this approach for bounded state spaces with skewed set of keys.