ACM Home Page
Please provide us with feedback. Feedback
On Herbrand semantics and conflict serializability of read-write transactions (extended abstract)
Full text PdfPdf (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
Jens Lechtenbörger  University of Münster, Germany
Gottfried Vossen  University of Münster, Germany
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 17,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/335168.335221
What is a DOI?

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
 
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
 
13
 
14

Collaborative Colleagues:
Jens Lechtenbörger: colleagues
Gottfried Vossen: colleagues

Peer to Peer - Readers of this Article have also read: