Journal of the ACM (JACM)
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)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
An Introduction to Database Systems
An Introduction to Database Systems
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 in a data flow database machine
Concurrency in a data flow database machine
The Performance of Flow Graph Locking
IEEE Transactions on Software Engineering
A non-blocking transaction data flow graph based approach for replicated data
ACM SIGOPS Operating Systems Review
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
A Multiagent Update Process in a Database with Temporal Data Dependencies and Schema Versioning
IEEE Transactions on Knowledge and Data Engineering
Non-blocking concurrency control in distributed database systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Parallel Concurrency Control Activity for Transaction Management in Real-time Database Systems
The Journal of Supercomputing
A concurrency control model for PDM systems
Computers in Industry
| Hi-index | 0.00 |
A non-two-phase database concurrency control technique is introduced. The technique is deadlock-free, places no restrictions on the structure of the data, never requires data to be reread, never forces a transaction to be rolled back in order to achieve serializability, applies a type of lock conversion, and allows items to be released to subsequent transactions as soon as possible. The method introduced, database flow graph locking (FGL), uses a directed acyclic graph to direct the migration of locks between transactions. Unlike many previous non-two-phase methods, the database need not be structured in any specific fashion. The effect of these changes is that, with the same serializable schedule, FGL obtains a higher degree of concurrency than two-phase locking (2PL). Overhead requirements for database flow graph locking are comparable to those for two-phase locking, with 2PL being better in low conflict situations and FGL better in high conflict.