Transactional replication
AssigneeInfoblox Inc.
InventorsStuart M. Bailey, Ivan W. Pulleyn, Srinath Gutti
Life of this patent
Estimating the term…
Abstract
Writing data in a distributed database having a plurality of nodes is disclosed. Writing includes receiving a write request at a node, wherein the write request is associated with one or more operations to define an atomic transaction and performing the atomic transaction based on the request. The atomic transaction includes writing to a first version of the database in the node and writing to an entity representative of a state of the first version of the database.
Claims30
A method of writing data in a distributed database having a plurality of nodes, comprising:
- receiving a write request at a first member node having a first version of a database;
- applying the received original write request to both the first version of the database and a journal queue in a single atomic transaction using a processor, comprising:
- placing the received write request in the journal, queue of the first member node, wherein the journal queue is associated with the first member node and is configured to store write requests that have not yet been reconciled with a master version of the database on a master node;
- propagating one or more items in the journal queue to the master node;
- determining whether a conflict exists between the first version of the database with the write request applied and a master version of the database;
- in the event that a conflict exists, reconciling a write request with the master version of the database;
- and
- in the event that a conflict does not exist:
- determining that the first version of the database is in a high availability pair, wherein the high availability pair includes a second version of the database in a second member node;
- and
- applying the received original write request to both the first version of the database and to the second version of the database in the second member node.
A computer program product for writing data in a distributed database having a plurality of nodes, the computer program product being embodied in a tangible computer readable storage medium and comprising computer instructions for:
- receiving a write request at a first member node having a first version of a database;
- applying the received original write request to both the first version of the database and a journal queue in a single atomic transaction, comprising:
- placing the write request in the journal, queue of the first member node, wherein the journal queue is associated with the first member node and is configured to store write requests that have not yet been reconciled with a master version of the database on a master node;
- propagating one or more items in the journal queue to the master node;
- determining whether a conflict exists between the first version of the database with the write request applied and a master version of the database;
- in the event that a conflict exists, reconciling a write request with the master version of the database;
- and
- in the event that a conflict does not exist:
- determining that the first version of the database is in a high availability pair, wherein the high availability pair includes a second version of the database in a second member node;
- and
- applying the received original write request to both the first version of the database and to the second version of the database in the second member node.
A system for writing data in a distributed database having a plurality of nodes, including:
- a processor configured to:
- receive a write request at a first member node having a first version of a database;
- apply the received original write request to both the first version of the database and a journal queue in a single atomic transaction, comprising to:
- place the write request in the journal, queue of the first member node, wherein the journal queue is associated with the first member node and is configured to store write requests that have not yet been reconciled with a master version of the database on a master node;
- propagate one or more items in the journal queue to the master node;
- determine whether a conflict exists between the first version of the database with the write request applied and a master version of the database;
- in the event that a conflict exists, reconcile write request with the master version of the database;
- and
- in the event that a conflict does not exist:
- determine that the first version of the database is in a high availability pair, wherein the high availability pair includes a second version of the database in a second member node;
- and
- apply the received original write request to both the first version of the database and to the second version of the database in the second member node;
- and
- a memory coupled to the processor and configured to provide the processor with instructions.
Dependencies are inferred from the claim text.