Home // DBKDA 2015, The Seventh International Conference on Advances in Databases, Knowledge, and Data Applications // View article

ORPE - A Data Semantics Driven Concurrency Control Mechanism

Authors:
Tim Lessner
Fritz Laux
Thomas M Connollly

Keywords: Multimodel concurrency control; transaction processing; optimistic concurrency control; snapshot isolation; performance analysis

Abstract:
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 first-n-readers-win strategy. Accordingly, the model is called PeFS. Under this model the TPC-C benchmark outperforms other CC mechanisms like optimistic Snapshot Isolation.

Pages: 147 to 152

Copyright: Copyright (c) IARIA, 2015

Publication date: May 24, 2015

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-408-4

Location: Rome, Italy

Dates: from May 24, 2015 to May 29, 2015