Updating replicated data in distributed database
The problem of applying update operations to relational tables under the supervision of a distributed database management system is considered.A model describing the minimal cost propagation strategy of an update request to all copies of the relevant relation is offered, and takes the form of an integer linear program.
Replication is useful in improving the availability of data by coping data at multiple sites.
If there are no spatial relationships between the two objects that are concurrently being updated at different sites, parallel updates will be completely allowed.
We argue that concurrent updates of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called Choi J.
Other members wishing to modify the data item must first contact the master node.
Allowing only a single master makes it easier to achieve consistency among the members of the group, but is less flexible than multi-master replication.