An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Read-only transactions in a distributed database
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multiversion concurrency control—theory and algorithms
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Concurrency Control Problem for Database Systems
Concurrency Control Problem for Database Systems
Sacrificing serializability to attain high availability of data in an unreliable network
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
On concurrency control by multiple versions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Obtaining Progressive Protocols for a Simple Multiversion Database Model
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Concurrency control algorithms for multiversion database systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Database concurrency control: versatile approaches to improve performance (protocols, locking, simulation)
On concurrent execution of information systems applications
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
1/k phase stamping for continuous shared data (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Concurrency control protocols based on two-phase locking are a popular family of locking protocols that preserve serializability in general (unstructured) database systems. A concurrency control algorithm (for databases with no inherent structure) is presented that is practical, non two-phase, and allows varieties of serializable logs not possible with any commonly known locking schemes. All transactions are required to predeclare the data they intend to read or write. Using this information, the protocol anticipates the existence (or absence) of possible conflicts and hence can allow non-two-phase locking.It is well known that serializability is characterized by acyclicity of the conflict graph representation of interleaved executions. The two-phase locking protocols allow only forward growth of the paths in the graph. The Five Color protocol allows the conflict graph to grow in any direction (avoiding two-phase constraints) and prevents cycles in the graph by maintaining transaction access information in the form of data-item markers. The read and write set information can also be used to provide relative immunity from deadlocks.