Binary data store

• US 9,053,130 B2
• Filed: 03/13/2013
• Issued: 06/09/2015
• Est. Priority Date: 04/02/2012
• Status: Active Grant

• Current Assignee: Stealth Software Holding BV
• Original Assignee: Stealth Software IP SARL
• Inventors: Garrard, Thomas
• Primary Examiner(s): Le, Chau
• Assistant Examiner(s): CHAUDHRY, MUHAMMAD U
• Application Number:
  US13/802,244
• Publication Number:
  US 20130262875A1
• Time in Patent Office: 818 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/2219 Large Object storage; Management thereof
• CPC Class Codes: G06F 16/24558 Binary matching operations
• CPC Class Codes: G06F 21/60 Protecting data
• CPC Class Codes: G06F 21/6218 to a system of files or objects, e.g. local or distributed file system or database
• CPC Class Codes: G06F 21/6245 Protecting personal data, e.g. for financial or medical purposes
• CPC Class Codes: G06F 2221/2115 Third party
• CPC Class Codes: H04L 2209/60 Digital content management, e.g. content distribution
• CPC Class Codes: H04L 9/08 Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords network architectures or network communication protocols for supporting key management in a packet data network H04L63/06
• CPC Class Codes: H04L 9/0897 involving additional devices, e.g. trusted platform module [TPM], smartcard or USB
• CPC Class Codes: H04L 9/14 using a plurality of keys or algorithms
• CPC Class Codes: H04L 9/16 the keys or algorithms being changed during operation
• CPC Class Codes: H04L 9/3213 using tickets or tokens, e.g. Kerberos network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807
• CPC Class Codes: H04L 9/3242 involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC

Abstract

A method for storing binary data, preferably in the form of Binary Large Objects (BLOBs), in more than one location. The method includes the steps of producing a processing thread corresponding to each location where the data is to be stored and verifying whether each thread has completed successfully after a predetermined time period. Information relating to the storage of the binary data is stored in an access token.

Claims

1. A method for storing binary data to at least two data stores, the method comprising the steps of:

at a storage interface, receiving, from a collaboration system, a store request and binary data that is to be stored;

at a storage interface, creating a first processing thread and a second processing thread;

at a storage interface, configuring the first processing thread for writing a backup of said binary data to a first data store;

at a storage interface, configuring the second processing thread for writing a backup of said binary data to a second data store separate from the first data store;

at a storage interface, concurrently executing the first processing thread and the second processing thread;

at a storage interface, checking for successful termination of said processing threads after a timeout delay;

at a storage interface, for each thread that has not successfully terminated after said timeout delay, creating an entry in a Control Log; and

at a storage interface, creating an access token for said binary data, and sending said access token to said collaboration system.

2. The method according to claim 1, wherein said timeout delay for said processing threads is computed as a factor of a running time of a first successfully terminating thread.

3. The method according to claim 1, wherein the Control Log is a database.

4. The method according to claim 1, wherein the method further comprises the step of computing a hash value for the binary data and wherein said access token comprises said hash value.

5. The method according to claim 1, wherein said Control Log entry comprises information on a data store in which the binary data was not successfully written.

6. The method according to claim 5, wherein the method further comprises the steps of:

creating a processing thread for each Control Log entry that indicates an unsuccessful storage operation of said binary data to a data store;

configuring each created processing thread for storing said binary data in one of said data stores; and

in case one of said processing threads succeeds in storing said binary data in said data store, updating the corresponding Control Log entry by providing the new storage location for said binary data.

7. The method according to claim 1, wherein the method further comprises the steps of:

at a storage interface, providing a first encryption key;

at a storage interface, generating a second encryption key;

at a storage interface, encrypting said binary data using said first and second encryption keys and an encryption algorithm;

at a storage interface, storing said encrypted binary data in at least one data store; and

at a storage interface, creating an access token to said stored binary data, including said second encryption key and returning it to said collaboration system.

8. The method according to claim 7, wherein the method further comprises the step of computing a hash value for said binary data, and wherein said access token comprises said hash value.

9. The method according to claim 7, wherein the encryption algorithm is a block cipher and the second encryption key is an Initialization Vector that is generated by the storage interface and used to randomize the binary data prior to encryption.

10. The method according to claim 9, wherein said access token comprises said Initialization Vector.

11. The method according to claim 1, wherein said collaboration system is a Microsoft SharePoint™

collaboration system.

12. The method according to claim 1, wherein the binary data is a Binary Large Object (BLOB).

13. A device comprising a processor and memory, the memory being configured with stored instructions that, in response to being processed by the processor, cause the device to carry out the method according to claim 1.