DMCA
The Serializability of Concurrent Database Updates (1979)
Cached
Download Links
- [www.cs.purdue.edu]
- [www.cs.purdue.edu]
- [www.cs.purdue.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of the ACM |
| Citations: | 246 - 0 self |
BibTeX
@ARTICLE{Papadimitriou79theserializability,
author = {Christos H. Papadimitriou},
title = {The Serializability of Concurrent Database Updates},
journal = {Journal of the ACM},
year = {1979},
volume = {26},
pages = {631--653}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 update problem, transactions, senahzabdlty, schedulers, concurrency control CR CATEGORIES 4 33, 5 25 1.
Keyphrases
concurrent database update senahzable history concurrency control cr category interleaved user transaction individual transaction concurrent update problem sequential execution np-complete problem efficient history scheduler senahzabdity principle new principle efficient scheduler finally database system sufficient condition recognizable subclass transaction history simple transaction model general transaction model senalizable history efficient scheduler
