Dependent commit queue for a database

• US 9,846,719 B2
• Filed: 02/03/2017
• Issued: 12/19/2017
• Est. Priority Date: 03/05/2009
• Status: Active Grant

• Current Assignee: MATRIXX Software, Inc.
• Original Assignee: MATRIXX Software, Inc.
• Inventors: Labuda, David
• Primary Examiner(s): VU, BAI DUC
• Application Number:
  US15/424,541
• Publication Number:
  US 20170228419A1
• Time in Patent Office: 319 Days
• Field of Search: None
• 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 element A for the first process;

read the first value for element A for the second process;

read a first value for element B for the second process;

calculate a first new value A1 for element A and a first new value B1 for element B for the second process;

update the first value for element A to the first new value A1 and the first value for element B to the first new value B1;

read the first new value B1 for element B for the first process;

calculate a second new value A2 for element A based at least in part on the first value for element A for the first process and a second new value B2 for element B based at least in part on the first new value B1 for element B for the first process;

update an actual value for element A to the second new value A2 in the event that the actual value for element A meets a first boundary condition to reduce database overheads in processing of the first process and the second process; and

update an actual value for element B to the second new value B2 in the event that the actual value for element B meets a second boundary condition to reduce database overheads in processing of the first process and the second process.

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

3. The database of claim 1, wherein the second boundary condition is based on the first new value B1 for element B.

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

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

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 element A does not meet the first boundary condition, the update of the actual value for element A to the second new value A2 is aborted.

9. The database of claim 1, wherein in the event that the actual value for element B does not meet the second boundary condition, the update of the actual value for element B to the second new value B2 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 element A for the first process;

reading the first value for element A for the second process;

reading a first value for element B for the second process;

calculating, using a processor, a first new value A1 for element A and a first new value B1 for element B for the second process;

updating the first value for element A to the first new value A1 and the first value for element B to the first new value B1;

reading the first new value B1 for element B for the first process;

calculating a second new value A2 for element A based at least in part on the first value for element A for the first process and a second new value B2 for element B based at least in part on the first new value B1 for element B for the first process;

updating an actual value for element A to the second new value A2 in the event that the actual value for element A meets a first boundary condition to reduce database overheads in processing of the first process and the second process; and

updating an actual value for element B to the second new value B2 in the event that the actual value for element B meets a second boundary condition to reduce database overheads in processing of the first process and the second process.

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

12. The method of claim 10, wherein the first boundary condition is based on the first value B1 for element B.

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

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

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 element A does not meet the first boundary condition, the update of the actual value for element A to the second new value A2 is aborted.

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

19. A computer program product for a database, the computer program product being embodied in a non-transitory 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 element A for the first process;

reading the first value for element A for the second process;

reading a first value for element B for the second process;

calculating, using a processor, a first new value A1 for element A and a first new value B1 for element B for the second process;

updating the first value for element A to the first new value A1 and the first value for element B to the first new value B1;

reading the first new value B1 for element B for the first process;

calculating a second new value A2 for element A based at least in part on the first value for element A for the first process and a second new value B2 for element B based at least in part on the first new value B1 for element B for the first process;

updating an actual value for element A to the second new value A2 in the event that the actual value for element A meets a first boundary condition to reduce database overheads in processing of the first process and the second process; and

updating an actual value for element B to the second new value B2 in the event that the actual value for element B meets a second boundary condition to reduce database overheads in processing of the first process and the second process.