Persistent data storage techniques

• US 8,935,225 B2
• Filed: 03/14/2013
• Issued: 01/13/2015
• Est. Priority Date: 10/13/2000
• Status: Expired due to Term

• Current Assignee: MIOsoft Corporation
• Original Assignee: MIOsoft Corporation
• Inventors: Barabas, Albert B., Siepmann, Ernst M., van Gulik, Mark D. A.
• Primary Examiner(s): To, Baoquoc N
• Application Number:
  US13/828,209
• Publication Number:
  US 20130212588A1
• Time in Patent Office: 670 Days
• Field of Search: 707/781, 707/704
• US Class Current: 707/704
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06F 16/2343 Locking methods, e.g. distributed locking or locking implementation details
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database

Abstract

A database is maintained that stores data persistently. Tasks are accepted from task sources. At least some of the tasks have competing requirements for use of regions of the database. Each of the regions includes data that is all either locked or not locked for writing at a given time. Each of the regions is associated with an available processor. For each of the tasks, jobs are defined each of which requires write access to regions that are to be accessed by no more than one of the processors. Jobs are distributed for concurrent execution by the associated processors.

Claims

1. A method comprising

accepting tasks from task sources, at least some of the tasks being associated with deadlines for execution,

defining, for each of the tasks, jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database and being assigned to the processors,

causing a processor to execute two or more jobs assigned to the processor in an order based on the deadlines associated with the tasks for which the two or more jobs are defined, and

causing the processor to execute other jobs assigned to the processor than the two or more jobs to be executed in an order based on locations of respective data to be accessed by the other jobs within the database.

2. A method comprising

maintaining a database that stores data persistently,

accepting jobs for concurrent execution by processors, the jobs requiring access to data in the database, and

causing each of the processors to execute at least some of the jobs, by accessing the data in the database, other than in the order in which the jobs are received for execution, the jobs being assigned to the processors based on characteristics of items of the data to be accessed by the processors.

3. The method of claim 2 in which the items of the data comprise objects in an object database.

4. The method of claim 2 in which the items of the data are provided as objects to an object-oriented application.

5. The method of claim 2, 3, or 4 in which the at least some of the jobs to be executed by one of the processors are replaced by a single aggregated job.

6. The method of claim 5 in which the jobs that are replaced have been pre-identified as requiring execution as a synchronization group to ensure correctness of results, all of the jobs of the synchronization group being associated with information that identifies them as members of the group and defines their respective fractions of a quorum.

7. The method of claim 2, 3, or 4 in which each of the processors determines an order in which to process at least some of the jobs based on physical locations on disk of the data that must be accessed by the jobs.

8. The method of claim 7 in which the processing order is determined based on a page structure of data on the disk.

9. The method of claim 7 in which the jobs are clustered for processing so that accesses to a given physical portion of the disk are clustered.

10. The method of claim 2, 3, or 4 in which at least some of the jobs to be executed by a processor are redundant, and the processor does not execute the redundant jobs.

11. The method of claim 10 in which the redundant jobs are identical, and fewer than all of the identical jobs are executed.

12. The method of claim 10 in which some of the redundant jobs supersede others of the redundant jobs and only the superseding jobs are executed.

13. The method of claim 12 in which the redundant jobs have associated time stamps and the superseding jobs have later time stamps than the superseded jobs.

14. A method comprising

accepting jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database and performing various actions with respect to the data, the actions being associated with respective indices,

causing each of the processors to execute at least some of the jobs in an order determined by the actions to be performed by the jobs with respect to the data, and

updating the indices associated with the performed actions.