Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Stearns, P. Lewis, D. Rosenkrantz (1976)
Concurrency control for database systems17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
N An overview of the preliminary design ofSSD-I: a system of distributed databases Proc
H. Kung, C. Papadimitriou (1979)
An optimality theory of concurrency control for databasesActa Informatica, 19
(1974)
Analysts of senahzablhty
(1970)
On formalized computer programs
P. Bernstein, David Shipman, J. Rothnie, N. Goodman (1977)
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The General Case)
A. Aho, J. Hopcroft, J. Ullman (1974)
The Design and Analysis of Computer Algorithms
A. Silberschatz, Z. Kedem (1980)
Consistency in Hierarchical Database SystemsJ. ACM, 27
(1978)
Analysis of senahzable logs Unpubhshed manuscript
(1976)
clocks and ordering of events in a distributed system TR CA-7603-2911
(1973)
N J
P. Bernstein, J. Rothnie, N. Goodman, C. Papadimitriou (1978)
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)IEEE Transactions on Software Engineering, SE-4
(1972)
Reducibihtles among combinatorial problems In Complexay of Computer Computa
(1977)
Computational problems related to database concurrency control
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
K. Eswaran, J. Gray, R. Lorie, I. Traiger (1976)
The notions of consistency and predicate locks in a database systemCommun. ACM, 19
A formal model of concurrency control mechamsms for database systems Proc 1978 Berkeley Workshop on Distributed Databases and Comptr Networks
(1976)
Towards a theory of correctness for multi-user data base systems
(1978)
A concurrent database problem binary search trees, an abstract
R. Tarjan (1972)
Depth-First Search and Linear Graph AlgorithmsSIAM J. Comput., 1
(1977)
Resolving certain concurrent update problems without locking an abstract
M. Garey, David Johnson (1979)
Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
The Serializability of Concurrent Database Updates CHRISTOS H. P A P A D I M I T R I O U Massachusetts Institute of Technology, Cambridge, Massachusetts ABSTRACT A sequence of interleaved user transactions in a database system may not be ser:ahzable, t e, equivalent to some sequential execution of the individual transactions Using a simple transaction model, it ~s shown that recognizing the transaction histories that are serlahzable is an NP-complete problem. Several efficiently recognizable subclasses of the class of senahzable histories are therefore introduced; most of these subclasses correspond to senahzabdity principles existing in the hterature and used in practice Two new principles that subsume all previously known ones are also proposed Necessary and sufficient conditions are given for a class of histories to be the output of an efficient history scheduler, these conditions imply that there can be no efficient scheduler that outputs all of senahzable histories, and also that all subclasses of senalizable histories studied above have an efficient scheduler Finally, it is shown how these results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems KEY WORDS AND PHRASES database management, concurrent
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Oct 1, 1979
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.