DBScholar

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
1051
Venue
PODS
Year
1995
Pagerank
5.093636e-05
Overall Rank
12,987 | 10.90%
DOI
10.1145/212433.212464

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{chaudhri_pods95,
        address = {New York, NY, USA},
        series = {{PODS} '95},
        title = {{Safe Locking Policies for Dynamic Databases}},
        url = {https://dl.acm.org/doi/10.1145/212433.212464},
        doi = {10.1145/212433.212464},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chaudhri, Vinay K. and Hadzilacos, Vassos},
        year = {1995}
}

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
3,384 Towards a Unified Theory of Concurrency Control and Recovery 1993 PODS 7.4552885e-05
5,696 Locks with Constrained Sharing (Extended Abstract) 1990 PODS 6.1174956e-05
Previous Page 1 / 1 Next

Semantically Similar Papers