Volltext-Downloads (blau) und Frontdoor-Views (grau)

O|R|P|E - A data semantics driven concurrency control mechanism

  • This paper presents a concurrency control mechanism that does not follow a ‘one concurrency control mechanism fits all needs’ strategy. With the presented mechanism a transaction runs under several concurrency control mechanisms and the appropriate one is chosen based on the accessed data. For this purpose, the data is divided into four classes based on its access type and usage (semantics). Class O (the optimistic class) implements a first-committer-wins strategy, class R (the reconciliation class) implements a first-n-committers-win strategy, class P (the pessimistic class) implements a first reader-wins strategy, and class E (the escrow class) implements a firsnreaderswin strategy. Accordingly, the model is called OjRjPjE. Under this model the TPC-C benchmark outperforms other CC mechanisms like optimistic Snapshot Isolation.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar


Author of HS ReutlingenLaux, Friedrich
Erschienen in:DBKDA 2015, the Seventh International Conference on Advances in Databases, Knowledge, and Data Applications : GraphSM 2015, the Second International Workshop on Large-Scale Graph Storage and Management ; May 24 - 29, 2015, Rome, Italy
Editor:Friedrich LauxORCiD, Andreas Schmidt, Maria Del Pilar Angeles, Iztok Savnik
Document Type:Conference proceeding
Publication year:2015
Tag:multimodel concurrency control; optimistic concurrency control; performance analysis; snapshot isolation; transaction processing
Page Number:6
First Page:147
Last Page:152
DDC classes:000 Allgemeines, Wissenschaft
Open access?:Ja
Licence (German):License Logo  Open Access