Abstract
This paper describes some results of a recent project to develop a theory for reasoning about atomic transactions. This theory allows careful statement of the correctness conditions to be satisfied by transaction-processing algorithms, as well as clear and concise description of such algorithms. It also serves as a framework for rigorous correctness proofs.
The work of the first author (and through her, the work of the fourth author) was supported in part be the office of Naval Research under Contract N00014-85-K-0168, by the National Science Foundation under Grant CCR-8611442, and by the Defense Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. The work of the third author was supported in part by the National Science Foundation under Grant CCR-8716884, and by the Defense Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
8 References
Aspnes, J., Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "A Theory of Timestamp-Based Concurrency Control for Nested Transactions," Proceedings of 14th International Conference on Very Large Data Bases, to appear.
Beeri, C., Bernstein, P. A., and Goodman, N., "A Model for Concurrency in Nested Transaction Systems," Technical Report, Wang Institute TR-86-03, March 1986.
Bernstein, P., Hadzilacos, V., and Goodman, N., "Concurrency Control and Recovery in Database Systems," Addison-Wesley, 1987.
Davies, C. T., "Recovery Semantics for a DB/DC Systems," Proceedings of 28th ACM National Conference, 1973, pp. 136–141.
Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "Nested Transactions and Read/Write Locking," Proceedings of 6th ACM Symposium on Principles of Database Systems, 1987, pp. 97–111. An expanded version is available as Technical Memo MIT/LCS/TM-324, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1987.
Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "Nested Transactions, Conflict-Based Locking and Dynamic Atomicity," Technical Memo MIT/LCS/TM-340, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., September 1987. Submitted for publication.
Gifford, D., "Weighted Voting for Replicated Data," Proceedings of 7th ACM Symosium on Operating System Principles, 1979, pp. 150–162.
Goldman, K., and Lynch, N., "Nested Transactions and Quorum Consensus," Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987, pp. 27–41. An expanded version is available as Technical Report MIT/LCS/TR-390, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., May 1987.
Herlihy, M., "Extending Multiversion Time-Stamping Protocols to Exploit Type Information," IEEE Transactions on Computers C-36, April 1987.
Herlihy, M., Lynch, N., Merritt, M., and Weihl, W., "On the Correctness of Orphan Elimination Algorithms," Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, 1987, pp. 8–13.
Hoare, C. A. R., "Communicating Sequential Processes," Prentice Hall International, 1985.
Liskov, B., "Distributed Computing in Argus," Communications of ACM, vol. 31, no. 3, March 1988, pp. 300–312.
Lynch, N., and Merritt, M., "Introduction to the Theory of Nested Transactions," Technical Report MIT/LCS/TR-367, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., July 1986. To appear in Theoretical Computer Science.
Lynch, N., Merritt, M., Weihl, W., and Fekete, A., "Atomic Transactions," in preparation.
Lynch, N., and Tuttle, M., "Hierarchical Correctness Proofs for Distributed Algorithms," Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987, pp. 137–151. An expanded version is available as Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1987.
Milner, R., "A Calculus of Communicating Systems," Lecture Notes in Computer Science 92, Springer Verlag, 1980.
Moss, J. E. B., "Nested Transactions: An Approach To Reliable Distributed Computing," Ph.D. Thesis, Technical Report MIT/LCS/TR-260, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1981. Also, published by MIT Press, March 1985.
Perl, S., "Distributed Commit Protocols for Nested Atomic Actions," M.S. Thesis, M.I.T. September 1987.
Spector, A., and Swedlow, K. (eds), "Guide to the Camelot Distributed Transaction Facility: Release 1," Carnegie Mellon University, Pittsburgh, PA., October 1987.
Reed, D. P., "Naming and Synchronization in a Decentralized Computer System," Ph.D Thesis, Technical Report MIT/LCS/TR-205, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., September 1978.
Weihl, W., "Specification and Implementation of Atomic Data Types," Ph.D. Thesis, Technical Report MIT/LCS/TR-314, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., March 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lynch, N., Merritt, M., Weihl, W., Fekete, A. (1988). A theory of atomic transactions. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-50171-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50171-8
Online ISBN: 978-3-540-45943-9
eBook Packages: Springer Book Archive