Low Address Collision Rate in Multiple Hash Tables

摘要

We developed a data partitioning and a scheme of multiple hash tables for a scenario of concurrent computing. This paper presents some results showing that, for multiple hash tables with a total number of slots less than the target data-set, our key conversion prior to the modulo operation produces a number of address collisions less than, or in the worst case, equal to the modulo operation alone.