Christos H. Papadimitriou
- 1 AHO, A V, HOPCROI:T, J E, AND ULLMAN, J D The Design and Analysts of Computer Algoruhms Addtson- Wesley, Readtng, Mass, 1974 Google Scholar
- 2 BERNSTEIN, P A, GOODMAN, N. ROTHNIE, J B, AND PAPADIMITRIOU, C H Analysts of senahzabdtty of SDD-1' a system of d,stnbuted databases (the fully redundant case). IEEE Trans. on Software Eng SE-4, 3 (May 1978), 154-168Google Scholar
- 3 BERNSTEIN, P A, PAPADIMITRIOU, C H., AND ROTHNIE, J B Resolving certam concurrent update problems wnhout locking an abstract Proc IEEE Workshop on OS and DBMS, Chtcago, I11, 1977Google Scholar
- 4 BERNSTEIN, P A, AND SHIPMAN, D W A formal model of concurrency control mechamsms for database systems Proc 1978 Berkeley Workshop on Dtstdbuted Databases and Comptr Networks, Berkeley, Cahf, Sept 1978, pp 189-205~Google Scholar
- 5 BERNSTEIN, P A, SHIPMAN, D W, ROTHNIE, J B, AND GOODMAN, N The concurrency control mechanism of SDD-1 a system for d~stnbuted databases (the general case) TR CCA-77-09, Computer Corporation of America, Cambridge, Mass, 1977Google Scholar
- 6 COFFMAN, E G, AND DENNING, P Operatmg Systems Theory Prentice-Hall, Englewood Cliffs, N J., 1973. Google Scholar
- 7 ESWARAN, K P, GRAY, J N, LORIE, R A, AND TRAIGER, I L The notions of consistency and predicate locks Jn a database system, Comm ,4 CM 19, 11 (Nov 1976), 624-633 Google Scholar
- 8 GAREY, M R, AND JOHNSON, D S Computers and lntractabthty A Grade to the Theory of NP-Completeness Freeman, San Francisco, 1979 Google Scholar
- 9 KARP, R M Reducibdmes among combinatorial problems In Complexay of Computer Computaoons, R E Miller and J W Thatcher, Eds, Plenum Press, New York, 1972, pp 85-103Google Scholar
- 10 KUNG, H T, AND LEHMAN, P L A concurrent database problem binary search trees, an abstract. Proc 4th Int Conf on Very Large Databases, West Berlin, Germany, 1978, p 498 (Full paper to appear in A CM Trans Data Base Syst )Google Scholar
- 11 KUNG, H T, AND PAPADIMITRIOU, C H An optimahty theory of concurrenc} control for databases. Proc 1979 SIGMOD Conf, Boston, Mass., May, 1979 Google Scholar
- 12 LAMPORT, L Towards a theory of correctness for multi-user data base systems. TR CA-7610-0712, Massachusetts Computer Associates, 1976Google Scholar
- 13 LAMPORT, L Time, clocks and ordering of events m a distributed system TR CA-7603-2911, Massachusetts Computer Associates, 1976Google Scholar
- 14 LUCKHAM, D C, PARK, D M R, AND PATERSON, M S. On formalized computer programs J Comptr. Syst Sct 4, 3 (1970), 220-249Google Scholar
- 15 PAPADIMITRIOLI, C H, BERNSTEIN, P A, AND ROTHNIE, J B Computational problems related to database concurrency control Proc Conf on Theor Comptr Sci, U of Waterloo, Ontario, Canada, 1977.Google Scholar
- 16 PAPADIMITRIOU, C H, AND STEIGLITZ, K Combinatorial Opmnlzat~on Algorahms. (In preparation )Google Scholar
- 17 ROTHNIE, J B, AND GOODMAN, N An overview of the preliminary design of SSD-I: a system of distributed databases Proc 1977 Berkeley Workshop on Distributed Data Management and Comptr. Networks, Berkeley, Cahf, May 1977Google Scholar
- 18 SILBERSCHATZ, A, AND KEDEM, Z Consistency in hierarchical database systems (To appear in Jr. ACM.) Google Scholar
- 19 STEARNS, R C, LEWIS, P M, AND ROSENKRANTZ, D J Concurrency control for database systems Proc. 16th Conf Found Comptr Sct, 1976, pp 19-32Google Scholar
- 20 TARJAN, R E Depth-first search and linear graph algorithms Slam J Comptg 1, 2 (1973), 146-160.Google Scholar
- 21 THOMAS, R H A solution to the update problem for multiple copy databases which uses distributed control TR 3340, Bolt, Beranek and Newman, Cambridge, Mass, 1976Google Scholar
- 22 WONG, W Analysis of senahzable logs Unpublished manuscript, Harvard Umversity, Cambridge, Mass, 1978Google Scholar
Index Terms
- The serializability of concurrent database updates
Recommendations
Concurrent updates with RCU: search tree as an example
PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computingRead copy update (RCU) is a novel synchronization mechanism, in which the burden of synchronization falls completely on the updaters, by having them wait for all pre-existing readers to finish their read-side critical section. This paper presents citrus,...
Formal Aspects of Serializability in Database Concurrency Control
An arbitrary interleaved execution of transactions in a database system can lead to an inconsistent database state. A number of synchronization mechanisms have been proposed to prevent such spurious behavior. To gain insight into these mechanisms, we ...
Comments