System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Process synchronization in database systems
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Mathematical Theory of Computation
Mathematical Theory of Computation
Formal Aspects of Serializability in Database Concurrency Control
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Comments on “Process synchronizaiton in databases systems”
ACM Transactions on Database Systems (TODS)
Reply to "Errors in 'Process synchronization in database systems'"
ACM SIGMOD Record
Hi-index | 0.00 |
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.