Maximal concurrency by locking

Authors:
Georg Lausen;Eljas Soisalon-Soininen;Peter Widmayer
Affiliations:
Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, West Germany;Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, West Germany;Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, West Germany
Venue:
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1984

Citing 5
Cited 1

The serializability of concurrent database updates

Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems

Journal of the ACM (JACM)
A theorem in database concurrency control

Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system

Communications of the ACM
Issues of correctness in database concurrency control by locking

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Pre-analysis locking: a safe and deadlock free locking policy

VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of a database concurrency control mechanism is to control a transaction system in such a way that only serializable executions of transactions are possible; that is, safety is enforced. Locking is an appropriate means to achieve safety. In this paper the following problem is considered:Can the set of all serializable schedules (in the sense of conflict-preserving serializability) of a transaction system be defined by locking, i.e., can maximal concurrency be achieved by locking?An efficient algorithm exists for the problem in the case of two-transaction systems, but in general the problem is NP-complete. In the case in which maximal concurrency indeed is achievable by locking a locking policy realizing maximal concurrency can be constructed efficiently. Finally, an easy-to-test sufficient condition under which maximal concurrency is achieved by locking is discussed.