# US 2013/0212588 A1 · Persistent data storage techniques

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0212588 A1
- Document ID: US20130212588A1
- Status: Published application
- Kind: A1
- Application number: 13/828,209
- Filed: 2013-03-14
- Published: 2013-08-15
- Earliest claimed: 2000-10-13
- Assignees: Miosoft Corporation
- Inventors: Albert B. Barabas; Ernst M. Siepmann; Mark D.A. van Gulik
- Web page: https://patentgrep.com/patent/US20130212588A1

## CPC

- G06F 16/2343: {Locking methods, e.g. distributed locking or locking implementation details}
- G06F 9/46: Multiprogramming arrangements
- G06F 16/23: Updating
- G06F 16/2379: {Updates performed during online database operations; commit processing}
- G06F 16/289: {Object oriented databases}
- Y10S 707/99938: Concurrency, e.g. lock management in shared database
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## 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

### Claim 1

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 database.

### Claim 2 (depends on 1)

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

### Claim 3 (depends on 1)

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

### Claim 4 (depends on 1, 2)

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

### Claim 5 (depends on 4)

The method of claim 4 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.

### Claim 6 (depends on 1, 2)

The method of claim 1, 2, or 3 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.

### Claim 7 (depends on 6)

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

### Claim 8 (depends on 6)

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

### Claim 9 (depends on 1, 2)

The method of claim 1, 2, or 3 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.

### Claim 10 (depends on 9)

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

### Claim 11 (depends on 9)

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

### Claim 12 (depends on 11)

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

### Claim 13

A method comprising
accepting jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database that is partitioned into regions, and
causing at least some of the processors to execute at least some of the jobs other than in the order in which the jobs are accepted for execution, the jobs being assigned to the processors based on respective regions of the database to which the data to be accessed belongs.

### Claim 14

A method comprising
accepting jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database that is partitioned into regions, and
causing at least some of the processors to execute at least some of the jobs in an order based on the regions of the database to be accessed by the jobs.

### Claim 15

A method comprising
accepting jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database, and
causing the processors to execute at least some of the jobs synchronously.

### Claim 16

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
causing each of the processors to execute at least some of the jobs in an order based on the deadlines associated with the tasks.

### Claim 17

A method comprising
accepting jobs for concurrent execution by processors, the jobs requiring access to data that is stored persistently in a database, and
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.
