| Abstraction in recovery management |
| Full text |
Pdf
(1.41 MB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 1986 ACM SIGMOD international conference on Management of data
table of contents
Washington, D.C., United States
Pages: 72 - 83
Year of Publication: 1986
ISBN:0-89791-191-1
Also published in ...
|
|
Authors
|
|
J. Eliot B Moss
|
Department of Computer and Information Science, University of Massachusetts, Amherst, Massachusetts
|
|
Nancy D. Griffeth
|
School of Informatron and Computer Science, Georgia Institute of Technology, Atlanta, Georgia
|
|
Marc H. Graham
|
School of Informatron and Computer Science, Georgia Institute of Technology, Atlanta, Georgia
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 22, Citation Count: 30
|
|
|
ABSTRACT
There are many examples of actions on abstract data types which can be correctly implemented with nonserializable and nonrecoverable schedules of reads and writes. We examine a model of multiple layers of abstraction that explains this phenomenon and suggests an approach to building layered systems with transaction oriented synchronization and roll back. Our model may make it easier to provide the high data integrity of reliable database transaction processing in a broader class of information systems. We concentrate on the recovery aspects here, a technical report [Moss et al 85] has a more complete discussion of concurrency control.
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.
 |
Beeri et al 83
|
C. Beeri , P. A. Bernstein , N. Goodman , M. Y. Lai , D. E. Shasha, A concurrency control theory for nested transactions (Preliminary Report), Proceedings of the second annual ACM symposium on Principles of distributed computing, p.45-62, August 17-19, 1983, Montreal, Quebec, Canada
[doi> 10.1145/800221.806709]
|
 |
Eswaren et al 76
|
|
 |
Garcia and Wiederhold 82
|
|
 |
Hadzilacos 83
|
|
 |
Haerder and Reuter 83
|
|
 |
Lynch 83
|
|
| |
Moss et al 85
|
|
 |
Papadimitriou 79
|
|
 |
Schwarz and Spector 84
|
|
| |
Weihl 84
|
|
CITED BY 30
|
|
Hans-Jörg Schek , Gerhard Weikum , Haiyan Ye, Towards a unified theory of concurrency control and recovery, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.300-311, May 25-28, 1993, Washington, D.C., United States
|
|
|
|
|
|
Gustavo Alonso , Stephen Blott , Armin Fessler , Hans-Jörg Schek, Correctness and parallelism in composite systems, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.197-208, May 11-15, 1997, Tucson, Arizona, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
H. -J. Schek , H. -B. Paul , M. H. Scholl , G. Weikum, The DASDBS Project: Objectives, Experiences, and Future Prospects, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.25-43, March 1990
|
|
|
|
|
|
Gerhard Weikum , Christof Hasse , Peter Broessler , Peter Muth, Multi-level recovery, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.109-123, April 02-04, 1990, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
Michelle J. Moravan , Jayaram Bobba , Kevin E. Moore , Luke Yen , Mark D. Hill , Ben Liblit , Michael M. Swift , David A. Wood, Supporting nested transactional memory in logTM, ACM SIGPLAN Notices, v.41 n.11, November 2006
|
|
|
Brian D. Carlstrom , Austen McDonald , Michael Carbin , Christos Kozyrakis , Kunle Olukotun, Transactional collection classes, Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming, March 14-17, 2007, San Jose, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|