Skip to main content
Conference Proceedings

A transaction model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1980) 85 LNCS 282-298
DOI: 10.1007/3-540-10003-2_78
15Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is an attempt to tersely restate several theoretical results about transaction recovery and concurrency control. A formal model of entities, actions, transactions, entity failures, concurrency and distributed system is required to present these results. Included are theorems on transaction undo and redo, degrees of consistency, predicate locks, granularity of locks, deadlock, and two-phase commit.

Cite

CITATION STYLE

APA

Gray, J. (1980). A transaction model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 85 LNCS, pp. 282–298). Springer Verlag. https://doi.org/10.1007/3-540-10003-2_78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free