Informatik
Refine
Year of publication
- 2015 (80) (remove)
Document Type
- Conference proceeding (59)
- Journal article (11)
- Book (4)
- Book chapter (3)
- Doctoral Thesis (3)
Is part of the Bibliography
- yes (80)
Institute
- Informatik (80)
Publisher
- Gesellschaft für Informatik (20)
- Springer (11)
- Hochschule Reutlingen (8)
- IEEE (5)
- ACM (4)
- IARIA (3)
- 3m5.Media GmbH (1)
- American Marketing Association (1)
- CSW-Verlag (1)
- Deutsche Gesellschaft für Computer- und Roboterassistierte Chirurgie e. V. (1)
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.