This paper describes in detail how to implement multiple concurrent transactions with fine-granularity locking in a database system using shadow paging for crash recovery. The basic idea is to store the updates separately until the transaction requests to commit, at which time the changes are patched to the global database. Commit batching is used to achieve reasonable performance; its gains are much higher with shadow paging than with log-based systems. Due to early releasing of locks, locking durations do not increase because of commit batching. 1 Introduction Traditionally, shadow paging has been considered to have poor performance and to be unsuitable for large multi-user systems [1, 3, 5, 6]. However, Kent [5, 6] has shown how to use...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
The recent development of multi-core computer architectures has largely affected the creation of eve...
The maintenance of materialized aggregate join views is a well-studied problem. However, to date the...
Shadow paging has a number of desirable properties, of which snapshots are discussed in this paper. ...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
. Two-phase locking is a standard method for managing concurrent transactions in database systems. I...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
In multi-version databases, updates and deletions of records by transactions require appending a new...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (max...
Various techniques have been proposed to ensure the safe, concurrent execution of a set of database ...
A new scheme for physically accessing tuples by multiple transactions is described for database syst...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
The recent development of multi-core computer architectures has largely affected the creation of eve...
The maintenance of materialized aggregate join views is a well-studied problem. However, to date the...
Shadow paging has a number of desirable properties, of which snapshots are discussed in this paper. ...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
. Two-phase locking is a standard method for managing concurrent transactions in database systems. I...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
In multi-version databases, updates and deletions of records by transactions require appending a new...
The concurrency control lock (e.g. file lock, table lock) has long been used as a canonical example ...
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (max...
Various techniques have been proposed to ensure the safe, concurrent execution of a set of database ...
A new scheme for physically accessing tuples by multiple transactions is described for database syst...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
The recent development of multi-core computer architectures has largely affected the creation of eve...
The maintenance of materialized aggregate join views is a well-studied problem. However, to date the...