Cicada
Authors:
Open Access
- 9 May 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 21-35
Abstract
Multi-core in-memory databases promise high-speed online transaction processing. However, the performance of individual designs suffers when the workload characteristics miss their small sweet spot of a desired contention level, read-write ratio, record size, processing rate, and so forth. Cicada is a single-node multi-core in-memory transactional database with serializability. To provide high performance under diverse workloads, Cicada reduces overhead and contention at several levels of the system by leveraging optimistic and multi-version concurrency control schemes and multiple loosely synchronized clocks while mitigating their drawbacks. On the TPC-C and YCSB benchmarks, Cicada outperforms Silo, TicToc, FOEDUS, MOCC, two-phase locking, Hekaton, and ERMIA in most scenarios, achieving up to 3X higher throughput than the next fastest design. It handles up to 2.07 M TPC-C transactions per second and 56.5 M YCSB transactions per second, and scans up to 356 M records per second on a single 28-core machine.Keywords
Funding Information
- National Science Foundation (1345305,1535821)
- Intel (ISTC-CC, ISTC-VCS)
This publication has 42 references indexed in Scilit:
- NVRAM-aware logging in transaction systemsProceedings of the VLDB Endowment, 2014
- Staring into the abyssProceedings of the VLDB Endowment, 2014
- Serializable snapshot isolation in PostgreSQLProceedings of the VLDB Endowment, 2012
- High-performance concurrency control mechanisms for main-memory databasesProceedings of the VLDB Endowment, 2011
- H-storeProceedings of the VLDB Endowment, 2008
- Group commit timers and high volume transaction systemsLecture Notes in Computer Science, 1989
- Efficient locking for concurrent operations on B-treesACM Transactions on Database Systems, 1981
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981
- Concurrency Control in Distributed Database SystemsACM Computing Surveys, 1981
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976