Merge, commit recovery protocol for real-time database management systems

• US 5,497,487 A
• Filed: 04/28/1994
• Issued: 03/05/1996
• Est. Priority Date: 04/28/1994
• Status: Expired due to Fees

• Current Assignee: the united states of america as represented by the secretary of the navy
• Original Assignee: the united states of america as represented by the secretary of the navy
• Inventors: Fortier, Paul J.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Lintz, Paul R.
• Application Number:
  US08/236,900
• Time in Patent Office: 677 Days
• Field of Search: 395/600, 395/726, 395/650
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1474 in transactions G06F16/20 takes precedence
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

A computer database method using data organized data into atomic data sets and transactions separated into a plurality of statements called projections which operate on only one said atomic data set. Statements such as read commands, write commands, assignment commands, transaction delimiting commands, and projection delimiting commands are executed, and a depends on graph is created during execution of the statements. Projection recovery data is stored during operation. When a statement requests commit the depends on graph is analyzed to determine if the projection is related to another projection in the transaction. The projection is committed if it is not related to another projection and delayed if related to another projection. Likewise, the system determines related projections and aborts them together if a transaction error occurs. The method can recover to a consistent database state after projection abortion.

Claims

1. A computer database method comprising the steps of:

organizing data into atomic data sets;

breaking down transactions containing a plurality of statements operating on said data into projections having statements which operate on only one said atomic data set;

executing statements from one said projection, said statements comprising read commands, write commands, assignment commands, transaction delimiting commands, and projection delimiting commands;

generating a depends on graph during execution of said statements;

storing projection recovery data during execution of said statements;

analyzing said depends on graph upon receipt of a projection commit command to determine if said projection is related to at least one other projection;

committing said projection if said analyzed projection is separate from said other projections;

delaying commit of said analyzed projection until the receipt of a projection commit command of said related projection if said projection is related to another projection;

analyzing said depends on graph if a transaction error is encountered to determine if a currently active projection is related to another projection;

aborting said currently active projection upon a transaction error;

aborting said related projections to said currently active projection if any, after encountering a transaction error; and

recovering from said aborted projection to a consistent database state.

2. The method of claim 1 wherein the step of generating a depends on graph comprises the steps of:

allocating a variable lock table after starting a transaction;

identifying a variable in said lock table on initial use of said variable by a statement;

inserting a definition lock linked to said identified variable in said lock table, said definition lock being held by the command issuing projection upon execution of a read command;

inserting a use lock linked to an identified variable used in the argument of an assignment command, said definition lock being held by the transaction;

inserting a use lock linked to an identified variable used as the data source of a write command, said definition lock being held by the projection identified with the written to data set;

inserting an inferred definition lock linked to an identified variable used as the result variable of an assignment command, said inferred definition lock being held by the last at least one projection locking said result variable or said argument variables of said assignment command; and

generating pointers from said use locks inserted by said assignment command to said inferred definition locks inserted by said assignment command.

3. The method of claim 2 wherein the step of analyzing said depends on graph comprises the steps of:

referencing sequentially each said identified variable of said projection for which said commit command has been received in said variable lock table; and

determining if said definition locks, inferred definition locks, use locks, and pointers indicate that said projection is related to another projection.

4. The method of claim 2 wherein said use locks, definition locks, and inferred definition locks are inserted in said lock table in a hierarchical fashion indicating lock placement order for each said variable.

5. The method of claim 4 wherein the step of analyzing said depends on graph comprises the steps of:

referencing each said identified variable of said projection for which said commit command has been received in said variable lock table sequentially;

checking said lock placed on said variable latest in time first;

checking said locks pointed to by said pointers and any locks placed on said pointed to lock variable later in time;

checking said locks placed earlier in time; and

continuing checking said locks until all locks in said hierarchic chain have been checked.