DEPENDENT COMMIT QUEUE FOR A DATABASE

• US 20160350349A1
• Filed: 02/24/2016
• Published: 12/01/2016
• Est. Priority Date: 03/05/2009
• Status: Active Grant

• Current Assignee: MATRIXX Software, Inc.
• Original Assignee: MATRIXX Software, Inc.
• Inventors: Labuda, David
• Granted Patent: US 9,600,511 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/2315 Optimistic concurrency control
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing

Abstract

A database comprises a database interface and a database updater. The database interface receives a first set of information and a second set of information to be updated in the database. The database updater updates a second set of information in the database based at least in part on a condition that a first set of information in the database has been previously updated.

Claims

1. A database, comprising:

an interface configured to;

receive an indication to start a first process and a second process; and

a processor configured to;

read a first value for A for the first process;

read the first value for A for the second process;

calculate a first new value A1 based on the first value for A for the first process;

update the first value for A to the first new value in the event that the first value for A meets a first boundary condition;

calculate a second new value A2 based on the first value for A for the second process; and

update an actual value for A to the second new value in the event that the actual value for A meets a second boundary condition, wherein the actual value for A has been updated from the first value for A to the first new value A1 by the first process.

2. The database of claim 1, wherein the first boundary condition is calculated based on the first value for A.

3. The database of claim 1, wherein the first boundary condition comprises a first lower bound.

4. The database of claim 1, wherein the first boundary condition comprises a first upper bound.

5. The database of claim 1, wherein the second boundary condition is calculated based on the first value for A.

6. The database of claim 1, wherein the second boundary condition comprises a second lower bound.

7. The database of claim 1, wherein the second boundary condition comprises a second upper bound.

8. The database of claim 1, wherein in the event that the first value for A does not meet the first boundary condition, the update of the first value for A is aborted.

9. The database of claim 1, wherein in the event that the actual value for A does not meet the second boundary condition, the update of the actual value for A is aborted.

10. A method for a database, comprising:

receiving an indication to start a first process and a second process; and

reading a first value for A for the first process;

reading the first value for A for the second process;

calculating, using a processor, a first new value A1 based on the first value for A for the first process;

updating the first value for A to the first new value in the event that the first value for A meets a first boundary condition;

calculating a second new value A2 based on the first value for A for the second process; and

updating an actual value for A to the second new value in the event that the actual value for A meets a second boundary condition, wherein the actual value for A has been updated from the first value for A to the first new value A1 by the first process.

11. The method of claim 10, wherein the first boundary condition is calculated based on the first value for A.

12. The method of claim 10, wherein the first boundary condition comprises a first lower bound.

13. The method of claim 10, wherein the first boundary condition comprises a first upper bound.

14. The method of claim 10, wherein the second boundary condition is calculated based on the first value for A.

15. The method of claim 10, wherein the second boundary condition comprises a second lower bound.

16. The method of claim 10, wherein the second boundary condition comprises a second upper bound.

17. The method of claim 10, wherein in the event that the first value for A does not meet the first boundary condition, the update of the first value for A is aborted.

18. The method of claim 10, wherein in the event that the actual value for A does not meet the second boundary condition, the update of the actual value for A is aborted.

19. A computer program product for a database, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for:

receiving an indication to start a first process and a second process; and

reading a first value for A for the first process;

reading the first value for A for the second process;

calculating, using a processor, a first new value A1 based on the first value for A for the first process;

updating the first value for A to the first new value in the event that the first value for A meets a first boundary condition;

calculating a second new value A2 based on the first value for A for the second process; and

updating an actual value for A to the second new value in the event that the actual value for A meets a second boundary condition, wherein the actual value for A has been updated from the first value for A to the first new value A1 by the first process.