Database concurrency control with precision:
- rthogonal key-value locking
Goetz Graefe
Database concurrency control with precision: orthogonal key-value - - PowerPoint PPT Presentation
Database concurrency control with precision: orthogonal key-value locking Goetz Graefe Locks vs latches 2 Transaction isolation levels Snapshot isolation great for read-only transactions on multi-version storage 0. No locks no
Goetz Graefe
2
Snapshot isolation – great for read-only transactions on multi-version storage 0. No locks – no concurrency control 1. Dirty read – only write locks, no locks for reads 2. Cursor stability – short read locks 3. Repeatable read – read locks on presence but not on absence 4. Serializable – “repeatable count” – locks on predicates or on gaps Simple and reliable transaction logic requires ___ .
3
4
5
Summary of possible lock scopes:
6
Select count (*) where FirstName = ‘Harry’
7
Gerhard, Gottfried, Hank
Select count (*) where FirstName = ‘Jerry’
8
James Jim
...where FirstName between ‘Jerry’ and ‘Mary’
9
Irv Mohan
...where row# = 3 Non-key fields (“include” syntax), deletion (to ghost), insertion (from ghost)
10
Select count (*) where FirstName = ‘Harry’
11
12