Additional hash functions in content-based addressing

• US 7,373,345 B2
• Filed: 02/19/2004
• Issued: 05/13/2008
• Est. Priority Date: 02/21/2003
• Status: Active Grant

• Current Assignee: DataCore Software Corporation (Flagship Ventures 2004 Fund LLC)
• Original Assignee: Caringo Incorporated
• Inventors: Forret, Peter, Willems, Maarten J. P. A., Carpentier, Paul R. M.
• Primary Examiner(s): Lu; Kuen S
• Application Number:
  US10/782,137
• Publication Number:
  US 20040220975A1
• Time in Patent Office: 1,545 Days
• Field of Search: 707/9, 707/205, 707/1, 707/204, 707/4, 707/102, 707/101, 707/5, 707/6
• US Class Current: 1/1
• CPC Class Codes: G06F 16/137 Hash-based content-based indexing of textual data G06F16/31
• CPC Class Codes: G06F 21/64 Protecting data integrity, e.g. using checksums, certificates or signatures
• CPC Class Codes: Y10S 707/99939 Privileged access
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

A hash function used for content addressing is different from the hash function used for content verification. Adding a file to a database involves storing both hash function values in a table as pair. Verifying the integrity of a file believed to be a duplicate in a database, or when retrieving a file, makes use of the verification hash function. Files can be continuously checked. A multi-level database can be used. A second hash function can be added to an existing system. A verification hash function can be upgraded and more than one content verification hash function can be used. In a variation, a random number generator is used instead of a hash function for content addressing; the verification hash function is also used. Files addressed using a random number are added or retrieved from a database and their verification hash values are checked. Time stamps and digital signatures are used for security.

Claims

1. A method of retrieving a desired computer file from a database, said method comprising:

obtaining a unique identifier for said desired computer file, said unique identifier used to identify a unique location in said database;

retrieving a stored file from said database using said unique identifier as a reference;

retrieving a unique identifier-verification hash value pair from a data structure associated with said database by using said unique identifier, wherein said retrieved verification hash value has been previously derived from said stored file using a verification hash function, said retrieved verification hash value being different from said unique identifier;

computing a verification hash value for said stored file using said verification hash function;

comparing said computed verification hash value to said retrieved verification hash value; and

determining that said stored file is said desired file when said computed verification hash value matches said retrieved verification hash value, said computed verification hash value being used to verify the contents of said stored file, whereby said desired file is retrieved from said database.

2. A method as recited in claim 1 further comprising:

receiving a request from a user to retrieve said desired file, said request including said unique identifier; and

when it is determined that said stored file is said desired file, delivering said stored file to said user.

3. A method as recited in claim 1 further comprising:

performing said step of retrieving a stored file by searching said data structure for said unique identifier.

4. A method as recited in claim 1 wherein said data structure is a table, a list or a tree data structure.

5. A method as recited in claim 1 wherein said unique identifier is an identifying hash value computed from said file using an identifying hash function, is a random number generated using a random number generator, or is a pseudo random number generated using a pseudo random number generator.

6. A method as recited in claim 1 wherein said verification hash value is a unique, content-based identifier.

7. A method as recited in claim 1 wherein said unique identifier is computed from a first hash function, and wherein said verification hash function provides stronger security than said first hash function.