Patent ID: 8595239

Claim:
A method for storing elements in a hash table comprising: creating the hash table in at least one non-transitory memory, the hash table having a plurality of hash table buckets such that a count of the plurality of hash table buckets is greater than or equal to a maximum count of elements to be stored in the hash table over a period in which the hash table is used; storing a plurality of elements in the plurality of hash table buckets such that each hash table bucket has one of the plurality of elements; and adding, by a processor, a new element to the hash table wherein adding includes: determining, using only one hash function, a plurality of hash table indexes identifying at least some of the hash table buckets in which the new element will be inserted, wherein determining a hash table index includes: determining a hash function output using an input associated with the new element; transforming the hash function output using a transform technique to reduce a range of the hash function; and determining the hash table index using the transformed hash function output, deleting elements stored in the identified hash table buckets, and inserting the new element in the identified hash table buckets.