Abstract:
Commercial databases support different isolation levels to allow programmers to trade off consistency for a potential gain in performance. The isolation levels are defined in the current ANSI standard, but the definitions are ambiguous and revised definitions proposed to correct the problem are too constrained since they allow only pessimistic (locking) implementations. This paper presents new specifications for the ANSI levels. Our specifications are portable; they apply not only to locking implementations, but also to optimistic and multi-version concurrency control schemes. Furthermore, unlike earlier definitions, our new specifications handle predicates in a correct and flexible manner at all levels. 1. Introduction This paper gives new, precise definitions of the ANSISQL isolation levels [6]. Unlike previous proposals [13, 6, 8], the new definitions are both correct (they rule out all bad histories) and implementation-independent. Our specifications allow a wide range of concurr...
Citations
|
1320
|
Concurrency Control and Recovery in Database Systems
– Bernstein, Hadzilacos, et al.
- 1987
|
|
1143
|
Transaction Processing: Concepts and Techniques
– Gray, Reuter
- 1993
|
|
776
|
Disconnected operation in the Coda file system
– Kistler, Satyanarayanan
- 1991
|
|
604
|
Operating System Concepts
– Silberschatz, Galvin, et al.
- 2005
|
|
413
|
An Introduction to Database Systems
– Date
- 2000
|
|
367
|
The dangers of replication and a solution
– Gray, Helland, et al.
- 1996
|
|
351
|
On optimistic methods for concurrency control
– Kung, Robinson
- 1981
|
|
134
|
A critique of ansi sql isolation levels
– Berenson, Bernstein, et al.
- 1995
|
|
134
|
Granularity of Locks and Degrees of Consistency in a Shared Database
– Gray, Lorie, et al.
- 1975
|
|
102
|
Synthesis of Extended Transaction Models using Acta
– Chrysanthis, Ramamritham
- 1994
|
|
84
|
Efficient optimistic concurrency control using loosely synchronized clocks
– Adya, Gruber, et al.
- 1995
|
|
71
|
The Escrow Transaction Method
– O'Neil
- 1986
|
|
68
|
Apologizing versus asking permission: Optimistic concurrency control for abstract data types
– Herlihy
- 1990
|
|
51
|
Safe and efficient sharing of persistent objects in Thor
– Liskov, Adya, et al.
- 1996
|
|
42
|
Efficient Concurrency Control for Broadcast Environments
– Shanmugasundaram, Nithrakashyap, et al.
- 1999
|
|
33
|
Consistency and Orderability: Semantics-Based Correctness Criteria for Databases
– Agrawal, Abbadi, et al.
- 1993
|
|
24
|
Optimism vs. Locking: A Study of Concurrency Control for Client-Server ObjectOriented Databases
– Gruber
- 1996
|
|
23
|
Disconnected operation in the Thor object-oriented database system
– Gruber, Kaashoek, et al.
- 1994
|
|
20
|
Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
– Adya
- 1999
|
|
20
|
et al., “Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System
– Terry
- 1995
|
|
17
|
Lazy consistency using loosely synchronized clocks
– Adya, Liskov
- 1997
|
|
11
|
Distributed Multi-version Optimistic Concurrency Control with Reduced Rollback
– Agrawal, Bernstein, et al.
- 1987
|
|
11
|
Semanticsbased Concurrency Control
– Badrinath, Ramamritham
- 1992
|
|
6
|
Concurrency Control, Transaction Isolation and Serializability
– Corporation
- 1995
|
|
1
|
Development of an Object-Oriented dDBMS
– Maier, Stein, et al.
- 1986
|