Patent ID: 7984028

Claim:
A method of collision prevention or minimization for application of hash function in data transfer, data manipulation, telecommunication, verification, encryption, compression, or networking, said method, comprising: using multiple hash functions to create corresponding multiple hash tables, where each hash table includes entries for a plurality of indices in collision, each hash table formed by hashing a corresponding plurality of keys with a common hash function; hashing a first key with a first hash function; in response to hashing said first key with said first hash function, selecting an entry in a first selection table, cross-referenced to an entry in a first hash table; in response to an overflow-flag in said entry in said first selection table not being set, determining if a candidate index is sought in said first hash table as follows: generating a key extract for the first key; generating an index extract for said entry in said first selection table; comparing said ex extracts with said key extract; and, in response to determining a matching index extract, selecting the index associated with a snatching index extract as said candidate index; in response to said overflow-flag said entry in said first selection table being set, hashing said first key with a second hash function associated with a second hash table; and, determining if the candidate index is sought in said second hash table.