Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Evaluation of a multiple version scheme for concurrency control
Information Systems
Modular synchronization in multiversion databases: version control and concurrency control
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Performance of concurrency control mechanisms in centralized database systems
Performance of concurrency control mechanisms in centralized database systems
A critique of ANSI SQL isolation levels
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Information Sciences: an International Journal
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems (TODS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
On Mixing Queries and Transactions via Multiversion Locking
Proceedings of the Eighth International Conference on Data Engineering
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A transaction model and multiversion concurrency control for mobile database systems
Distributed and Parallel Databases
Serializable isolation for snapshot databases
ACM Transactions on Database Systems (TODS)
Improving OLTP scalability using speculative lock inheritance
Proceedings of the VLDB Endowment
Data-oriented transaction execution
Proceedings of the VLDB Endowment
One-copy serializability with snapshot isolation under the hood
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Proceedings of the VLDB Endowment
Lightweight locking for main memory database systems
Proceedings of the VLDB Endowment
From A to E: analyzing TPC's OLTP benchmarks: the obsolete, the ubiquitous, the unexplored
Proceedings of the 16th International Conference on Extending Database Technology
Scalable and dynamically balanced shared-everything OLTP with physiological partitioning
The VLDB Journal — The International Journal on Very Large Data Bases
Hekaton: SQL server's memory-optimized OLTP engine
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Enabling efficient OS paging for main-memory OLTP databases
Proceedings of the Ninth International Workshop on Data Management on New Hardware
Energy-efficient in-memory database computing
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Speedy transactions in multicore in-memory databases
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Concurrent operations of O2-tree on shared memory multicore architectures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
LLAMA: a cache/storage subsystem for modern hardware
Proceedings of the VLDB Endowment
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
Microsoft SQL server's integrated database approach for modern applications and hardware
Proceedings of the VLDB Endowment
SI-TM: reducing transactional memory abort rates through snapshot isolation
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured: one is optimistic and one is pessimistic. To avoid expensive context switching, transactions never block during normal processing but they may have to wait before commit to ensure correct serialization ordering. We also implemented a main-memory optimized version of single-version locking. Experimental results show that while single-version locking works well when transactions are short and contention is low performance degrades under more demanding conditions. The multiversion schemes have higher overhead but are much less sensitive to hotspots and the presence of long-running transactions.