to the right hash table to examine the entry f held in the cell r j 0 of ri x in this example the li f bucket of the left hash table also holds j 3 entries the algorithm then switches back to the left hash table to examine the next cell l j 1 in the left bucket indexed by li x the righthash function is applied to z the entry held in l j 1 of the left bucket to generate the index ri z of a right bucket in this example the number of entries in the right bucket indexed by ri z is equal to 2 which is less than j 3 the entry z held in cell l j 1 in the left bucket indexed by li x is now moved to the cell r j 2 in the right bucket indexed by ri z and the entry x inserted into the now empty cell l j 1 of the left bucket in this way the number of entries in the buckets is balanced the configuration of the tables after the application of the algorithm is depicted in fig5 b if the bucket indexed by ri z did not have less than j entries then the cell r j 1 of the ri x bucket would be examined an so on thus the algorithm alternately examines successive cells in the left and right buckets indexed by the new entry x in another embodiment the algorithm is expanded in a recursive way when all j entries of first level buckets are occupied optimization is applied to those entries of subsequent level buckets until a loop is.