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

Authors:
Georg Lausen;Eljas Soisalon-Soininen;Peter Widmayer
Affiliations:
-;-;-
Venue:
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Year:
1985

Citing 7
Cited 0

The serializability of concurrent database updates

Journal of the ACM (JACM)
Consistency in Hierarchical Database Systems

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

Journal of the ACM (JACM)
Serializability by Locking

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

Communications of the ACM
Maximal concurrency by locking

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Issues of correctness in database concurrency control by locking

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A safe and deadlock free lock policy is introduced, called pre-analysis locking. Pre-analysis locking is based on an efficient geometric algorithm which inserts lock and unlock operations into the transactions. Pre-analysis locking is the first safe and deadlock free general locking policy which is not a variant of two-phase locking. It is an approach con- ceptually different from policies following the two-phase locking principle. In general, none of pre-analysis lock- ing and two-phase locking dominates the other: there exist cases in which pre-analysis locking allows for more concur- rency than any two-phase locking policy, but there are also cases in which a two-phase locking policy allows for more concurrency than pre-analysis locking.