Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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. © 1976, ACM. All rights reserved.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
David S. Kung
DAC 1998