IEEE Transactions on Software Engineering · 1987 · 57 citations · 15 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsFormal MethodsConcurrency ControlConcurrency VerificationConcurrent System VerificationDistributed DatabasesDistributed TransactionsTransaction ManagementCertification-based Concurrency ControlCommit OrderingCommit ProtocolsConsistency In Distributed DatabasesConsistency ProtocolsDistributed Database ManagementLockingSerialization
This paper introduces, as an optimistic concurrency control method, a new certification method by means of intervals of timestamps, usable in a distributed database system. The main advantage of this method is that it allows a chronological commit order which differs from the serialization one (thus avoiding rejections or delays of transactions which occur in usual certification methods or in classical locking or timestamping ones). The use of the dependency graph permits both classifying this method among existing ones and proving it. The certification protocol is first presented under the hypothesis that transactions' certifications are processed in the same order on all the concerned sites; it is then extended to allow concurrent certifications of transactions.
15
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
Parallelism and recovery in database systems
Raymond Bayer, Hans Heller, Angelika Reiser · ACM Transactions on Database Systems · 1980 · 189 citations · Full text