-
1.发明授权公开(公告)号：US08903779B1
公开(公告)日：2014-12-02
申请号：US14199534
申请日：2014-03-06
Applicant: Gravic, Inc.
Inventor： Paul J. Holenstein , John R. Hoffmann , Jonathan M. Ziegler , Bruce D. Holenstein , Wilbur H. Highleyman
CPC classification number: G06F11/1469 , G06F11/1456 , G06F11/1471 , G06F17/30368 , G06F2201/80
Abstract: A corrupted database is returned to a correct state by rolling forward or backward through a change queue and applying changes to the database in a selective manner. Changes that did not cause the corruption are applied without modification when rolling forward or are skipped when rolling backward. Changes that caused corruption are addressed when rolling forward, such as by being ignored or modified and then applied. Changes that caused corruption are corrected when rolling backward.
Abstract translation: 通过改变队列向前或向后滚动并以选择性方式对数据库应用更改，将损坏的数据库返回到正确的状态。 不会导致损坏的更改在向前滚动时被应用而不进行修改，或者在向后滚动时被跳过。 导致损坏的更改在向前滚动时得到解决，例如被忽略或修改然后应用。 导致损坏的更改会在向后滚动时更正。
-
公开(公告)号：US11768822B1
公开(公告)日：2023-09-26
申请号：US18296534
申请日：2023-04-06
Applicant: Gravic, Inc.
Inventor： Paul J. Holenstein , Bruce D. Holenstein , Dylan R. Holenstein , Jonathan M. Ziegler , Joseph A. Wynn
CPC classification number: G06F16/2358 , G06F16/2365 , G06F16/2386 , H04L9/3239
Abstract: A method is provided for validating transactions in a system that includes indeterministic ordering of change log events by using deterministic indicia. The system includes a plurality of nodes. Each node in the system includes an instance of a database used by an application, and a change log associated with the instance of the database used by the application. Each node executes transactions. Each transaction includes one or more data manipulation language (DML) or data definition language (DDL) operations. Results of the DML or DDL, operations are stored in the change log as change log events, wherein the order of the change log events stored in the change log on one node is in a different order than the order of change log events stored in the change log of at least one of the other nodes. For each transaction executing at each node, deterministic subunits of the change log events are defined. Indicia are then computed for each subunit of the change log events. The subunits are ordered by the computed indicia. Deterministic indicia are then computed for the transaction from the ordered subunits. The transaction is then validated with at least one of the other nodes using the deterministic indicia. The validation indicates either a match or a mismatch of the deterministic indicia computed at the plurality of nodes.
-
公开(公告)号：US12105699B1
公开(公告)日：2024-10-01
申请号：US18465770
申请日：2023-09-12
Applicant: Gravic, Inc.
Inventor： Paul J. Holenstein , Bruce D. Holenstein , Dylan R. Holenstein , Jonathan M. Ziegler , Joseph A. Wynn
CPC classification number: G06F16/2358 , G06F16/2365 , G06F16/2386 , H04L9/3239
Abstract: A method is provided for validating transactions in a system that includes indeterministic ordering of change log events by using deterministic indicia. The system includes a plurality of nodes. Each node in the system includes an instance of a database used by an application, and a change log associated with the instance of the database used by the application. Each node executes transactions. Each transaction has a plurality of subsets including one or more data manipulation language (DML) or data definition language (DDL) operations. Results of the DML or DDL operations are stored in the change log as change log events, wherein the order of the change log events stored in the change log on one node is in a different order than the order of change log events stored in the change log of at least one of the other nodes. For each subset of a transaction executing at each node, deterministic subunits of the change log events are defined. Indicia are then computed for each subunit of the change log events. The subunits are ordered by the computed indicia. Deterministic indicia are then computed for the subset of the transaction from the ordered subunits. The subset of the transaction is then validated with at least one of the other nodes using the deterministic indicia. The validation indicates either a match or a mismatch of the deterministic indicia computed at the plurality of nodes. This process is then repeated for one or more remaining subsets of the plurality of subsets of the transaction.
-
-
Search Results
3
records
(took 0.012 seconds)
