The Serial Safety Net
Authors:
Open Access
- 31 May 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Abstract
Concurrency control (CC) algorithms must trade off strictness for performance, with serializable schemes generally paying high cost---both in runtime overhead such as contention on lock tables, and in wasted efforts by aborting transactions---to prevent anomalies. We propose the serial safety net (SSN), a serializability-enforcing certifier for modern hardware with substantial core count and large main memory. SSN can be applied with minimal overhead on top of various CC schemes that offer higher performance but admit anomalies, e.g., snapshot isolation and read committed. We demonstrate the efficiency, accuracy and robustness of SSN using a memory-optimized OLTP engine with different CC schemes. We find that SSN is a promising approach to serializability with low abort rates and robust performance for various workloads.Keywords
This publication has 22 references indexed in Scilit:
- Multi-version Concurrency via Timestamp Range Conflict Management2012
- Shore-MT2009
- Making snapshot isolation serializableACM Transactions on Database Systems, 2005
- A read-only transaction anomaly under snapshot isolationACM SIGMOD Record, 2004
- Conflict free transaction scheduling using serialization graph for real-time databasesJournal of Systems and Software, 2000
- A critique of ANSI SQL isolation levels1995
- Serialization graph algorithms for multiversion concurrency control1988
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- General purpose schedulers for database systemsActa Informatica, 1980
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979