An Aggressive Concurrency Control Protocol for Main Memory Databases

In this paper, we propose a concurrency control protocol, called the Prudent-Precedence Concurrency Control (PPCC) protocol, for high data contention main memory databases. PPCC is prudently more aggressive in permitting more serializable schedules than two-phase locking. It maintains a restricted precedence among conflicting transactions and commits the transactions according to the serialization order established in the executions. A detailed simulation model has been constructed and extensive experiments have been conducted to evaluate the performance of the proposed approach. The results demonstrate that the proposed algorithm outperforms the two-phase locking in all ranges of system workload.

[1]  Miron Livny,et al.  Concurrency control performance modeling: alternatives and implications , 1987, TODS.

[2]  David P. Reed,et al.  Implementing atomic actions on decentralized data , 1983, TOCS.

[3]  Andrew S. Tanenbaum,et al.  A distributed file service based on optimistic concurrency control , 1985, SOSP '85.

[4]  Miron Livny,et al.  Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication , 1988, VLDB.

[5]  Theo Härder,et al.  Observations on optimistic concurrency control schemes , 1984, Inf. Syst..

[6]  Daniel J. Abadi,et al.  Lightweight Locking for Main Memory Database Systems , 2012, Proc. VLDB Endow..

[7]  Alfons Kemper,et al.  Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems , 2015, SIGMOD Conference.

[8]  Thki Hder,et al.  OBSERVATIONS ON OPTIMISTIC CONCURRENCY CONTROL SCHEMES , 2003 .

[9]  Stefano Ceri,et al.  On the Use of Optimistic Methods for Concurrency Control in Distributed Databases , 1982, Berkeley Workshop.

[10]  Kwok-Wa Lam,et al.  Distributed real-time optimistic concurrency control protocol , 1996, Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems.

[11]  Jignesh M. Patel,et al.  High-Performance Concurrency Control Mechanisms for Main-Memory Databases , 2011, Proc. VLDB Endow..

[12]  Michael Stonebraker,et al.  Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores , 2014, Proc. VLDB Endow..

[13]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[14]  Miron Livny,et al.  Dynamic real-time optimistic concurrency control , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[15]  Daniel J. Abadi,et al.  Low overhead concurrency control for partitioned main memory databases , 2010, SIGMOD Conference.

[16]  Özgür Ulusoy,et al.  Exploiting main memory DBMS features to improve real-time concurrency control protocols , 1996, SGMD.

[17]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.