Loading patent…
AssigneeGravic, Inc.
InventorsBruce D. Holenstein, Dylan R. Holenstein, Paul J. Holenstein
Estimating the term…
A method is provided for performing transaction processing in a system that includes a plurality of nodes. Each of the nodes include a processor, an application executing in the processor, and an instance of a database used by the application. Each node executes transactions. At least two of the nodes are dynamically selected to receive the same request to process a transaction, and the processor at each of the at least two nodes executes and validates the same request to process a transaction. One or more of the at least two nodes replicates the same request, steps and operations, and/or indicia of the transactions to one or more other nodes in the system. The processor at the one or more other nodes locally processes the transaction and compares its results with the replicated steps and operations and/or indicia of the transaction that were received from one of the at least two nodes and executes one or more remediation actions when the result of the comparison indicates that the replicated steps and operations, and/or indicia of the replicated transactions do not match.
A method of performing transaction processing in a system, the system including a plurality of nodes, each node in the system including (i) a processor, (ii) an application executing in the processor, and (iii) an instance of a database used by the application, each node executing transactions, each transaction including a BEGIN step, and one or more data manipulation language (DML) or data definition language (DDL) operations, the method comprising:
A method of performing transaction processing in a system, the system including a plurality of nodes, each node in the system including (i) a processor, (ii) an application executing in the processor, and (iii) an instance of a database used by the application, each node executing transactions, each transaction including a BEGIN step, and one or more data manipulation language (DML) or data definition language (DDL) operations, the method comprising:
Dependencies are inferred from the claim text.
Drawings are temporarily unavailable. Open the PDF at USPTO
From the US filing history. Foreign family members aren’t listed.
Updating: updates performed during online database operations; commit processing
Updating: ensuring data consistency and integrity
Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system…:…
Electronic shopping [e-shopping]: qualifying participants for shopping transactions
About 12 years 4 months of term left · ends 14 Feb 2039 (estimated)
Certain terms used in the “Background of the Invention” are defined in the section “I. Definitions.”
Computer Applications
Much of our daily lives is augmented by computers. The many services upon which we depend, our banking, investing, communications, air and rail travel, online shopping, credit-card and debit-card purchases, mail and package delivery, and electric-power distribution, are all managed by computer applications.
Preferred embodiments of the present invention will now be described by way of example with reference to the accompanying drawings:
FIG. 1 shows a prior art Active/Active System architecture.
FIG. 2 shows a prior art Dual Server Reliability (DSR) Validation architecture.
Certain terminology is used herein for convenience only and is not to be taken as a limitation on the present invention. The words “a” and “an”, as used in the claims and in the corresponding portions of the specification, mean “at least one.”
The following definitions describe the use of certain terms in this specification. They are hierarchically ordered in that each definition builds on previous definitions. Unless otherwise indicated, these definitions apply whether or not the term used in the disclosure is capitalized or not.
Table—A set of data values for a relational database that is organized using a model of horizontal rows and vertical columns. The columns are identified by name, and the rows can be uniquely identified by the values appearing in a particular column subset (the table's primary key). A table usually characterizes an entity set. Each row in the table describes an instance of the entity set. Each column describes an attribute of the entity set.