|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
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-168
|
| |
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, 1977
|
| |
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~
|
| |
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, 1977
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
| |
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-103
|
| |
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 )
|
 |
11
|
|
| |
12
|
LAMPORT, L Towards a theory of correctness for multi-user data base systems. TR CA-7610-0712, Massachusetts Computer Associates, 1976
|
| |
13
|
LAMPORT, L Time, clocks and ordering of events m a distributed system TR CA-7603-2911, Massachusetts Computer Associates, 1976
|
| |
14
|
LUCKHAM, D C, PARK, D M R, AND PATERSON, M S. On formalized computer programs J Comptr. Syst Sct 4, 3 (1970), 220-249
|
| |
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.
|
| |
16
|
PAPADIMITRIOU, C H, AND STEIGLITZ, K Combinatorial Opmnlzat~on Algorahms. (In preparation )
|
| |
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 1977
|
 |
18
|
|
| |
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-32
|
| |
20
|
TARJAN, R E Depth-first search and linear graph algorithms Slam J Comptg 1, 2 (1973), 146-160.
|
| |
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, 1976
|
| |
22
|
WONG, W Analysis of senahzable logs Unpublished manuscript, Harvard Umversity, Cambridge, Mass, 1978
|
CITED BY 188
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Fekete , N. Lynch , M. Merrit , W. Weihl, Nested transactions and read-write locking, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.97-111, March 23-25, 1987, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
William Weihl , Barbara Liskov, Specification and implementation of resilient, atomic data types, Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, p.53-64, June 27-29, 1983, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. Agrawal , A. El Abbadi , R. Jeffers, An approach to eliminate transaction blocking in locking protocols, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.223-235, June 02-05, 1992, San Diego, California, United States
|
|
|
D. Agrawal , J. L. Bruno , A. El Abbadi , V. Krishnaswamy, Relative serializability (extended abstract): an approach for relaxing the atomicity of transactions, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.139-149, May 24-27, 1994, Minneapolis, Minnesota, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nancy Lynch , Nir Shavit , Alex Shvartsman , Dan Touitou, Counting networks are practically linearizable, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.280-289, May 23-26, 1996, Philadelphia, Pennsylvania, United States
|
|
|
Brian A Coan , Brian M Oki , Elliot K Kolodner, Limitations on database availability when networks partition, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.187-194, August 11-13, 1986, Calgary, Alberta, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Francisco J. Torres-Rojas , Mustaque Ahamad , Michel Raynal, Timed consistency for shared distributed objects, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.163-172, May 04-06, 1999, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
C. Beeri , P. A. Bernstein , N. Goodman , M. Y. Lai , D. E. Shasha, A concurrency control theory for nested transactions (Preliminary Report), Proceedings of the second annual ACM symposium on Principles of distributed computing, p.45-62, August 17-19, 1983, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Chaiyasit Manovit , Sudheendra Hangal , Hassan Chafi , Austen McDonald , Christos Kozyrakis , Kunle Olukotun, Testing implementations of transactional memory, Proceedings of the 15th international conference on Parallel architectures and compilation techniques, September 16-20, 2006, Seattle, Washington, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
John Maccormick , Chandramohan A. Thekkath , Marcus Jager , Kristof Roomp , Lidong Zhou , Ryan Peterson, Niobe: A practical replication protocol, ACM Transactions on Storage (TOS), v.3 n.4, p.1-43, February 2008
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lidong Zhou , Vijayan Prabhakaran , Venugopalan Ramasubramanian , Roy Levin , Chandramohan A. Thekkath, Graceful degradation via versions: specifications and implementations, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|