Database Paper Browser

Back to papers

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)

Paper ID
682
Venue
PODS
Year
1984
Pagerank
-
Overall Rank
14,276 | 0.69%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
14,274 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,543 An Optimal Algorithm For Testing For Safety And Detecting Deadlocks In Locked Transaction Systems 1982 PODS 4.3265281e-05
Previous Page 1 / 1 Next

Semantically Similar Papers