Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Locking protocols: general lock classes and deadlock freedom
Locking protocols: general lock classes and deadlock freedom
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Locking Primitives in a Database System
Journal of the ACM (JACM)
Concurrency control in graph protocols by using edge locks
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Granularity hierarchies in concurrency control
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
The Performance of Concurrency Control Algorithms for Database Management Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Edge locks and deadlock avoidance in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
We define a series of locking protocols for database systems that all have three main features: freedom from deadlock, multiple granularity, and support for general collections of locking primitives. A rooted directed acyclic graph is used to represent multiple granularities, as in System R. Deadlock freedom is guaranteed by extending the System R protocol to require locks on edges of the graph in addition to the locks required on nodes.