Observations on optimistic concurrency control schemes
Information Systems - Special issue: Databases:8Mtheir creation, management and utilization
The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A theory of reliability in database systems
Journal of the ACM (JACM)
On rigorous Transaction Scheduling
IEEE Transactions on Software Engineering
Towards a unified theory of concurrency control and recovery
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The impact of recovery on concurrency control
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unifying concurrency control and recovery of transactions
Information Systems - Special issue on extending database technology
Unifying concurrency control and recovery of transactions with semantically rich operations
Theoretical Computer Science - Special issue: database theory
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Multi-Level Transaction Management, Theoretical Art or Practical Need ?
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Redesign of Optimistic Methods: Improving Performance and Applicability
Proceedings of the Second International Conference on Data Engineering
| Hi-index | 0.00 |
The quest for unified correctness criteria in database concurrency control is addressed from a new perspective. A family of Herbrand semantics is presented, where each semantics provides an interpretation for operations in the read-write model of transactions. Using commutativity arguments, each semantics leads to a notion of conflict, which then gives rise to distinct classes of serializable schedules. Surprisingly, the classical notion of serializability with respect to two of these sematics, update-in-place and deferred-update semantics, already embodies a unified correctness criterion; moreover, prefix-closed variants of it allow for a higher degree of transaction parallelism than, for example, prefix-reducibility. Finally, it is shown that previous criteria may permit undesirable schedules, which are ruled out by a stronger notion of serializability that captures all intuitively correct schedules, but is incomparable to prefix-reducibility and the classes of schedules recognized by optimistic protocols.