ACM Transactions on Database Systems (TODS)
Effects of locking granularity in a database management system
ACM Transactions on Database Systems (TODS)
Analysis of locking policies in database management systems
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Kardamom—a dataflow database machine for real-time applications
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Solving the Phantom Problem by Predicative Optimistic Concurrency Control
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
An Overview of The System Software of A Parallel Relational Database Machine GRACE
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A predicate-based caching scheme for client-server database architectures
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
Cooperative update exchange in the Youtopia system
Proceedings of the VLDB Endowment
A survey of B-tree locking techniques
ACM Transactions on Database Systems (TODS)
Foundations and Trends in Databases
| Hi-index | 0.00 |
This paper describes a new method for controlling data base concurrency, called precision locks (PL). The name is derived from the fact that they lock precisely the set of tuples required to guarantee data base consistency, phantoms included. This results in maximum concurrency among all tuple-level locking methods, including predicate locks. A framework for comparing locking systems which indicates the errors committed by them is introduced. It is shown that existing systems commit these errors while PL does not. While other logical locking systems are limited in the complexity of permissible predicates, PL allows them to be arbitrary. It is shown that transactions under PL are well formed and two phased which is sufficient to maintain consistency. The execution cost of PL is compared to a conventional tuple-level locking method. It is found that PL usually is cheaper to execute.