ACM Transactions on Database Systems · 1980 · 189 citations · 9 references
ComputingComputer ScienceDatabasesParallel AlgorithmsParallel ComputingConcurrency ControlData ParallelismData SynchronizationDatabase ManagementDatabase RecoveryParallel DatabasesDatabase Management SystemsParallel Database ArchitecturesParallel Database ProcessingParallel Database SystemsParallel RecoveryParallel Transaction ProcessingTransaction Processing
Database recovery often requires maintaining two versions of an object—the new and the old—to ensure consistency. The paper proposes a new method to increase parallelism in database systems by enabling readers and writers to operate concurrently on the same object. The method introduces a scheme that allows simultaneous reader–writer access to an object, with several variations tailored to the desired level of parallelism. The authors prove that transactions following this scheme preserve consistency.
In this paper a new method to increase parallelism in database systems is described. Use is made of the fact that for recovery reasons, we often have two values for one object in the database—the new one and the old one. Introduced and discussed in detail is a certain scheme by which readers and writers may work simultaneously on the same object. It is proved that transactions executed according to this scheme have the correct effect; i.e., consistency is preserved. Several variations of the basic scheme which are suitable depending on the degree of parallelism required, are described.
9
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
M. M. Astrahan, Michael W. Blasgen, Donald D. Chamberlin et al. · ACM Transactions on Database Systems · 1976 · 1K citations · Full text
Concurrency control for database systems
Richard E. Stearns, Philip Lewis, Daniel J. Rosenkrantz · 1976 · 106 citations