| On Herbrand semantics and conflict serializability of read-write transactions (extended abstract) |
| Full text |
Pdf
(172 KB)
|
| Source
|
Symposium on Principles of Database Systems
archive
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
table of contents
Dallas, Texas, United States
Pages: 187 - 194
Year of Publication: 2000
ISBN:1-58113-214-X
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 17, Citation Count: 0
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Gustavo Alonso , Radek Vingralek , Divyakant Agrawal , Yuri Breitbart , Amr El Abbadi , Hans-J. Schek , Gerhard Weikum, Unifying concurrency control and recovery of transactions, Information Systems, v.19 n.1, p.101-115, Jan. 1994
[doi> 10.1016/0306-4379(94)90029-9]
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
G. Lausen, "Formal Aspects of Optimistic Concurrency Control in a Multiple Version Database System," Information Systems 8, 1983, 291-301.
|
| |
9
|
J. LechtenbSrger, G. Vossen, "On Herbrand Semantics and Conflict Serializability of Read-Write Transactions," Technical Report, University of Miinster 2000.
|
| |
10
|
|
| |
11
|
|
 |
12
|
Hans-Jörg Schek , Gerhard Weikum , Haiyan Ye, Towards a unified theory of concurrency control and recovery, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.300-311, May 25-28, 1993, Washington, D.C., United States
[doi> 10.1145/153850.153935]
|
| |
13
|
|
| |
14
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|