Granted Patent B2

US 8,745,064 · App. 13/230,575 · Granted Jun 3, 2014

Abstract

Claims (41)

1. A method, comprising:

populating a hash table with a first new digest value;

wherein the first new digest value is associated with a first data item;

wherein the hash table comprises a plurality of index positions;

wherein the hash table is located in memory of a computer;

wherein the populating step comprises:

storing the first new digest value at least at a first index position and a second index position of the hash table, wherein, prior to the storing step, the first index position contains a first old digest value, and wherein the second index position contains a second old digest value;

wherein the storing step comprises:

determining the first index position, and the second index position of the hash table based on an attribute of the first data item, wherein the determining step comprises:

first producing a first hash value via a first data conversion module; and

second producing a second hash value via a second data conversion module;

wherein the first hash value is associated with the first index position;

wherein the second hash value is associated with the second index position;

first comparing the first new digest value to the first old digest value;

second comparing the first new digest value to the second old digest value;

first replacing the first old digest value with the first new digest value; and

second replacing the second old digest value with the first new digest value.

2. The method of claim 1 , further comprising:

transmitting, in response to at least one of the first or second comparing steps, a comparison result to an executable program.

3. The method of claim 1 , wherein the storing step is a first storing step, the method further comprising:

populating the hash table with a second new digest value;

wherein the second new digest value is associated with a second data item;

wherein the populating step comprises:

second storing the second new digest value at least at a third index position and a fourth index position of the hash table.

4. The method of claim 3 , wherein the first data item is different than the second data item.

5. The method of claim 4 , wherein the third index position is the same as the first index position, wherein the first new digest value is replaced with the second new digest value at the first index position, and wherein, after the second storing step, the first new digest value is stored at the second index position and the second new digest value is stored at the first index position and the fourth index position.

6. The method of claim 4 , wherein the third index position and fourth index position are both different than the first index position and the second index position, and wherein after the second storing step, the first new digest value is stored at the first index position and the second index position and the second new digest value is stored at the third index position and fourth index position.

7. The method of claim 1 , wherein the hash table is in communication with a hash program, Wherein the hash program comprises at least three data conversion modules, and wherein the ratio of the plurality of index positions to the data conversion modules is at least about 1024:3.

8. A system comprising:

(a) a memory of a computer;

(b) a hash table, wherein the hash table is located in the memory of the computer, and wherein the hash table comprises a plurality of index positions; and

(c) a hash program in communication with the hash table, wherein the hash program is operable to populate the hash table with a first new digest value, wherein the first new digest value is associated with a first data item, and wherein the first new digest value is stored at least at a first index position and a second index position of the hash table, wherein, prior to being stored, the first index position contains a first old digest value, and wherein the second index position contains a second old digest value;

wherein the hash program is operable to produce a first hash value via a first data conversion module and a second hash value via a second data conversion module, wherein the first hash value is associated with the first index position, and wherein the second hash value is associated with the second index position; and

wherein the hash program is operable to compare the first new digest value to the first old digest value and the second old digest value, and wherein the hash program is operable to replace both the first old digest value and the second old digest value with the first new digest value.

9. The system of claim 8 , wherein the first index position contains a first old digest value, and wherein the second index position contains a second old digest value.

10. The system of claim 8 , wherein the hash program is operable to transmit a comparison result to an executable program.

11. The system of claim 8 , wherein the hash program is operable to determine the first index position and the second index position of the hash table based on an attribute of the first data item.

12. The system of claim 8 , wherein the hash program is operable to populate the hash table with a second new digest value, and wherein the second new digest value is associated with a second data item, and wherein the second new digest value is stored at least at a third index position and a fourth index position of the hash table.

13. The system of claim 8 , wherein the hash program comprises at least three data conversion modules, and wherein the ratio of the plurality of index positions to the data conversion modules is at least about 1024:3.

14. The system of claim 8 , wherein the first data item is one of a plurality of data items, and wherein the ratio of the plurality of index positions of the hash table to the plurality of data items is at least 1:10.

15. The system of claim 8 , wherein each of the plurality of index positions contains one digest value.

Assignments (17)