DBScholar

Back to papers

Choice and Performance in Locking for Databases

Summary: Analytic model for database locking choices, spanning granularity, blocking versus restart conflict resolution, and lock timing (dynamic versus static). Derives how contention and workload intensity determine the performance-optimal strategy. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
7830
Venue
VLDB
Year
1984
Pagerank
6.8865551e-05
Overall Rank
4,124 | 71.71%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{tay_vldb84,
        title = {{Choice and Performance in Locking for Databases}},
        author = {Tay, Y.C. and Suri, Rajiv},
        journal = {PVLDB},
        series = {{VLDB} '84},
        pages = {119},
        year = {1984}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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
1,660 A Mean Value Performance Model for Locking in Databases: The Waiting Case 1984 PODS 0.00010079249
1,682 Concurrency In Database Systems - A Simulation Study 1977 SIGMOD 0.00010021488
Previous Page 1 / 1 Next

Semantically Similar Papers