TY - CHAP U1 - Konferenzveröffentlichung A1 - Lessner, Tim A1 - Laux, Fritz A1 - Connolly, Thomas ED - Laux, Fritz ED - Schmidt, Andreas ED - Del Pilar Angeles, Maria ED - Savnik, Iztok T1 - O|R|P|E - A data semantics driven concurrency control mechanism T2 - 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 N2 - 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. KW - multimodel concurrency control KW - transaction processing KW - optimistic concurrency control KW - snapshot isolation KW - performance analysis Y1 - 2015 U6 - https://nbn-resolving.org/urn:nbn:de:bsz:rt2-opus4-4029 UN - https://nbn-resolving.org/urn:nbn:de:bsz:rt2-opus4-4029 UR - http://www.thinkmind.org/index.php?view=instance&instance=DBKDA+2015 SN - 978-1-61208-408-4 SB - 978-1-61208-408-4 SP - 147 EP - 152 S1 - 6 PB - IARIA ER -