This is the authors' abstract. We don't add key points for this paper.
In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which satisfies the consistency condition is suggested.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Eswaran et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: