Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
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.
Hendrik F. Hamann
InterPACK 2013
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory