Maximal Concurrency By Locking
Summary: Studies whether locking can exactly characterize all conflict-serializable schedules (maximal concurrency by locking); shows two-transaction case is poly-time but the general decision problem is NP-complete. When possible builds an efficient locking policy and gives a simple sufficient test to detect maximal-concurrency-by-locking. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Georg Lausen (University of Karlsruhe)
- 2. Eljas Soisalon-Soininen (University of Helsinki; University of Karlsruhe)
- 3. Peter Widmayer (IBM; University of Karlsruhe)
BibTeX Citation
@inproceedings{lausen_pods84,
address = {New York, NY, USA},
series = {{PODS} '84},
title = {{MAXIMAL CONCURRENCY BY LOCKING}},
url = {https://dl.acm.org/doi/10.1145/588011.588018},
doi = {10.1145/588011.588018},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lausen, Georg and Soisalon-Soininen, Eljas and Widmayer, Peter},
year = {1984}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 14,475 | Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy | 1985 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,911 | An Optimal Algorithm For Testing For Safety And Detecting Deadlocks In Locked Transaction Systems | 1982 | PODS | 5.1972596e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,028 | A Simple Analytic Model For Performance Of Exclusive Locking In Database Systems | 1983 | PODS |
| 2 | 14,468 | The Complexity of Reliable Concurrency Control | 1985 | PODS |
| 3 | 14,478 | Concurrency Control in Graph Protocols by Using Edge Locks | 1984 | PODS |
| 4 | 6,751 | An Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems | 2002 | VLDB |
| 5 | 7,253 | Compatibility And Commutativity In Non-Two-Phase Locking Protocols | 1982 | PODS |
| 6 | 2,911 | The Performance of Concurrency Control Algorithms for Database Management Systems | 1984 | VLDB |
| 7 | 4,176 | An Abstract Model of Database Concurrency Control Algorithms | 1983 | SIGMOD |
| 8 | 13,210 | DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract) | 1985 | PODS |
| 9 | 4,777 | Is Distributed Locking Harder? | 1982 | PODS |
| 10 | 14,450 | Safety Of Non-Well-Locked Transaction Systems | 1986 | PODS |