Concurrency Control in Graph Protocols by Using Edge Locks

Summary: Separate item-level exclusive locks from precedence control by introducing edge locks and a transformation that maps any graph locking protocol to an equivalent edge-lock protocol preserving correctness. Characterize a broad class subsuming prior graph schemes, show increased concurrency and unify deadlock-avoidance techniques. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 683
Venue: PODS
Year: 1984
Pagerank: -
Overall Rank: 14,277 | 0.68%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Gael N. Buckley
2. Avi Silberschatz

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,351	An Abstract Model of Database Concurrency Control Algorithms	1983	SIGMOD	7.1873372e-05
14,249	Safety Of Non-Well-Locked Transaction Systems	1986	PODS	-
1,296	A Locking Protocol For Resource Coordination In Distributed Databases	1978	SIGMOD	0.00012758636
3,591	A Quantitative Comparison of Lock Protocols for Centralized Databases	1983	VLDB	6.9418919e-05
13,011	DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE (Extended Abstract)	1985	PODS	4.1945683e-05
5,201	Locks with Constrained Sharing (Extended Abstract)	1990	PODS	5.6336301e-05
6,341	An Almost-Serial Protocol for Transaction Execution in Main-Memory Database Systems	2002	VLDB	5.1037155e-05
14,276	Maximal Concurrency By Locking	1984	PODS	-
3,423	Is Distributed Locking Harder?	1982	PODS	7.1133874e-05
6,635	Compatibility And Commutativity In Non-Two-Phase Locking Protocols	1982	PODS	4.9823535e-05