Errors in 'process synchronization in database systems'
- 1 January 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 11 (1) , 9-29
- https://doi.org/10.1145/984471.984472
Abstract
This paper disproves several results pertaining to database concurrency control that are claimed in [8]. The results we disprove are•theorems 3.1, 3.2, 3.6 -- which claim a polynomial time algorithm for testing whether transaction schedules are serializable, and•theorems 4.2 and 4.7 -- which claim a necessary and sufficient mechanism for preserving the "weak consistency" of databases.In addition, we demonstrate that the notion of "weak consistency" introduced in [8] admits database states that are strictly inconsistent.Keywords
This publication has 5 references indexed in Scilit:
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979
- Process synchronization in database systemsACM Transactions on Database Systems, 1978
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)IEEE Transactions on Software Engineering, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976