The following pages link to On the power of safe locking (Q909495):
Displaying 11 items.
- An optimal predicate locking scheduler (Q676449) (← links)
- A superior two-phase locking algorithm amd its performance (Q751259) (← links)
- Is distributed locking harder? (Q1061510) (← links)
- Concurrent execution of transaction copies (Q1098626) (← links)
- Locking based on a pairwise decomposition of the transaction system (Q1202890) (← links)
- Safe locking policies for dynamic databases (Q1278036) (← links)
- Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access) (Q1825050) (← links)
- Safety by uninterpreted locks (Q1891161) (← links)
- Constrained shared locks for increasing concurrency in databases (Q1900916) (← links)
- Multi-granularity locking for nested transactions: A proof using a possibilities mapping (Q1901697) (← links)
- Locks, Bombs and Testing: The Case of Independent Locks (Q5153611) (← links)