Abstract | ||
---|---|---|
It is widely recognized by practitioners that concurrency control and recovery for transaction systems interact in subtle ways. In most theoretical work, however, concurrency control and recovery are treated as separate, largely independent problems. In this paper we investigate the interactions between concurrency control and recovery. We consider two general recovery methods for abstract data types, update-in-place and deferred-update. While each requires operations to conflict if they do not “commute,” the two recovery methods require subtly different notions of commutativity. We give a precise characterization of the conflict relations that work with each recovery method, and show that each permits conflict relations that the other does not. Thus, the two recovery methods place incomparable constraints on concurrency control. Our analysis applies to arbitrary abstract data types, including those with operations that may be partial or non-deterministic. |
Year | DOI | Venue |
---|---|---|
1993 | 10.1016/0022-0000(93)90023-P | J. Comput. Syst. Sci. |
Keywords | Field | DocType |
concurrency control | Abstract data type,Commutative property,Concurrency control,Computer science,Theoretical computer science,Database transaction,Optimistic concurrency control | Journal |
Volume | Issue | ISSN |
47 | 1 | Journal of Computer and System Sciences |
ISBN | Citations | PageRank |
0-89791-308-6 | 52 | 42.32 |
References | Authors | |
36 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
William E. Weihl | 1 | 2614 | 903.11 |