ACM Home Page
Please provide us with feedback. Feedback
The serializability of concurrent database updates
Full text PdfPdf (1.53 MB)
Source Journal of the ACM (JACM) archive
Volume 26 ,  Issue 4  (October 1979) table of contents
Pages: 631 - 653  
Year of Publication: 1979
ISSN:0004-5411
Author
Christos H. Papadimitriou  Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 163,   Citation Count: 187
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322154.322158
What is a DOI?

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

Collaborative Colleagues:
Christos H. Papadimitriou: colleagues