Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The serializability of concurrent database updates

The serializability of concurrent database updates 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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

The serializability of concurrent database updates

Journal of the ACM (JACM) , Volume 26 (4) – Oct 1, 1979

Loading next page...
 
/lp/association-for-computing-machinery/the-serializability-of-concurrent-database-updates-CzsjhTjK6t

References (22)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1979 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/322154.322158
Publisher site
See Article on Publisher Site

Abstract

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

Journal of the ACM (JACM)Association for Computing Machinery

Published: Oct 1, 1979

There are no references for this article.