A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets.

J. Xu: A Formal Model for Maximum Concurrency in Transaction Systems with Predeclared Writesets. VLDB 1982: 77-90

@inproceedings{DBLP:conf/vldb/Xu82,
  author    = {J. Xu},
  title     = {A Formal Model for Maximum Concurrency in Transaction Systems
               with Predeclared Writesets},
  booktitle = {Eigth International Conference on Very Large Data Bases, September
               8-10, 1982, Mexico City, Mexico, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1982},
  isbn      = {0-934613-14-1},
  pages     = {77-90},
  ee        = {db/conf/vldb/Xu82.html},
  crossref  = {DBLP:conf/vldb/82},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

This paper presents a formal model for studying the computation complexity of scheduling a whole set of transactions simultaneously in a transaction system with predeclared writesets. Our study clearly shows that there exists a fundsmental tradeoff between the amount of concurrency achieved and the computation overhead necessary to achieve that amount of concurrency. However, it is suggested that based on variants of the model introduced here, schedulers which schedule a whole set of transactions simultaneously may still be able to achieve a higher level of concurrency than conventional schedulers within reasonable computation complexity constraints.

Copyright © 1982 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.

Online Paper

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb7588 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Eigth International Conference on Very Large Data Bases, September 8-10, 1982, Mexico City, Mexico, Proceedings. Morgan Kaufmann 1982, ISBN 0-934613-14-1
Contents

References

[1]: ...
[2]: ...
[3]: Marco A. Casanova, Philip A. Bernstein: General Purpose Schedulers for Database Systems. Acta Inf. 14: 195-220(1980)
[4]: ...
[5]: Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976)
[6]: M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
[7]: ...
[8]: ...
[9]: Christos H. Papadimitriou: The serializability of concurrent database updates. J. ACM 26(4): 631-653(1979)
[10]: ...