On the complexity of concurrency control by locking in distributed database systems

Eswaran, 1976, The notions of consistency and predicate locks in a database system, Comm. ACM, 19, 624, 10.1145/360363.360369 Kanellakis, 1984, Is distributed locking harder?, J. Comput. System Sci., 28, 103, 10.1016/0022-0000(84)90078-3 Lipski, 1981, A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems, J. Algorithms, 2, 211, 10.1016/0196-6774(81)90023-7 Papadimitriou, 1982, A theorem in database concurrency control, J. Assoc. Comput. Mach., 29, 998, 10.1145/322344.322349 Papadimitriou, 1983, Theory of concurrency control, 35 Papadimitriou, 1983, Concurrency control by locking, SIAM J. Comput., 12, 215, 10.1137/0212013 Soisalon-Soininen, 1984, An optimal algorithm to compute the closure of a set of iso-rectangles, J. Algorithms, 5, 199, 10.1016/0196-6774(84)90027-0 Yannakakis, 1982, A theory of safe locking policies in database systems, J. Assoc. Comput. Mach., 29, 718, 10.1145/322326.322333 Yannakakis, 1982, Freedom from deadlock of safe locking policies, SIAM J. Comput., 11, 391, 10.1137/0211031