Database Paper Browser

Back to papers

Safe Locking Policies for Dynamic Databases

Summary: Generalizes Yannakakis' iff characterization of unsafe locking policies—existence of a canonical non-serializable schedule with all but one transaction serial—to dynamic databases that permit entity insertions/deletions. Applies this generalization to prove correctness of three locking policies for dynamic databases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1052
Venue
PODS
Year
1995
Pagerank
4.1945683e-05
Overall Rank
12,793 | 11.01%
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 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2,710 Towards a Unified Theory of Concurrency Control and Recovery 1993 PODS 8.2504476e-05
5,201 Locks with Constrained Sharing (Extended Abstract) 1990 PODS 5.6336301e-05
Previous Page 1 / 1 Next

Semantically Similar Papers