Locking is widely used as a concurrency control mechanism in database systems. As more OLTP databases are stored mostly or entirely in memory, transactional throughput is less and less limited by disk IO, and lock managers increas-ingly become performance bottlenecks. In this paper, we introduce very lightweight locking (VLL), an alternative approach to pessimistic concurrency control for main-memory database systems that avoids almost all overhead associated with traditional lock manager opera-tions. We also propose a protocol called selective contention analysis (SCA), which enables systems implementing VLL to achieve high transactional throughput under high con-tention workloads. We implement these protocols both in a traditional single-...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
Abstract: A distributed database system consists of a number of sites over a network and has a huge ...
In many database applications, incoming transactions are a mixed load of conventional (non real-time...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
Transaction processing workloads provide ample request level concurrency which highly parallel archi...
Multi-core scalability is one of the most important features for database systems running on today's...
Concurrency control provides multi-user access to a database system, while ensuring concurrent trans...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
A database system optimized for in-memory storage can support much higher transaction rates than cur...
Significant performance advantages can be realized by implementing a database system on a cache-cohe...
Although the general concepts provided by the standard concurrency control theory (e. g. [BHG87]) re...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
The performance of conventional distributed algorithms does not scale with the network data rate, ow...
Optimistic methods of concurrency control are gaining popularity. This is especially true with the r...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
Abstract: A distributed database system consists of a number of sites over a network and has a huge ...
In many database applications, incoming transactions are a mixed load of conventional (non real-time...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
Transaction processing workloads provide ample request level concurrency which highly parallel archi...
Multi-core scalability is one of the most important features for database systems running on today's...
Concurrency control provides multi-user access to a database system, while ensuring concurrent trans...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
A database system optimized for in-memory storage can support much higher transaction rates than cur...
Significant performance advantages can be realized by implementing a database system on a cache-cohe...
Although the general concepts provided by the standard concurrency control theory (e. g. [BHG87]) re...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
The performance of conventional distributed algorithms does not scale with the network data rate, ow...
Optimistic methods of concurrency control are gaining popularity. This is especially true with the r...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
Abstract: A distributed database system consists of a number of sites over a network and has a huge ...
In many database applications, incoming transactions are a mixed load of conventional (non real-time...