Purdue e-Pubs (Purdue University System) · 1991 · 22 citations · 17 references
Open access
ComputingComputer ScienceData ManagementDatabasesDistributed SystemsConcurrency ControlConsistency ModelsData ReplicationDatabase ManagementDistributed DatabasesDistributed TransactionsConsistencyConsistency EnforcementConsistency SemanticsConstraintsData Consistency ModelsDependency ConstraintsSerializability
Interdependent data are characterized by dependency constraints and mutual consistency requirements. Maintaining consistency of interdependent data that are managed by heterogeneous and autonomous DBMSs is a real problem faced in many practical computing environments. Supporting a mutual consistency criterion that is weaker than one copy serializability is often acceptable if better performance can be achieved and the autonomy of DBMSs is not sacrificed. Updates to interdependent data have to be controlled in order to maintain their consistency. We propose a solution where at least one of the copies of each interdependent data, called current copy, is kept up-to-date in the system. Using the concept of update through current copy, we show how a weaker mutual consistency requirement, called eventual consistency, can be satisfied. The proposed approach requires writing only the local copy (as opposed to writing many or all copies) and hence preserves autonomy by not requiring synchronization of the local concurrency controllers. This approach exploits the semantics of both the interdependent data and transactions; thus, it is non-intrusive, flexible and efficient.
17
The notions of consistency and predicate locks in a database system
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie et al. · Communications of the ACM · 1976 · 2K citations · Full text
Weighted voting for replicated data
David K. Gifford · 1979 · 1.3K citations · Full text