Key Range Locking Strategies for Improved Concurrency (1993) [17 citations — 2 self]
ftp://ftp.digital.fr/pub/DEC/CRL/tech-reports/93.2
http://www.hpl.hp.com/techreports/Compaq-DEC/CRL-9
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {David Lomet and David Lomet},
title = {Key Range Locking Strategies for Improved Concurrency},
booktitle = {In VLDB Proceedings},
year = {1993},
pages = {655--664}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
"Phantoms" are records inserted into a concurrently selected set of records specified by a predicate such that the selection does not see a transaction consistent result. The usual locking strategy is to lock only existing records. However, records that satisfy the selection predicate must be locked even when they are not present in the database to prevent their insertion. One way to cope with phantoms is through range locking, a limited form of predicate locking. We investigate lock modes for ranges and describe new lock modes that greatly increase concurrency. We explore locking strategies involving range, key, and record resources that permit trade-offs between concurrency and lock overhead. Keywords: concurrency, range locking, locking granularity, phantoms c flDigital Equipment Corporation 1993. All rights reserved. 1 1 Introduction 1.1 The Phantom Problem Relational databases permit their users to select sets of tuples of relations based on a predicate. Transaction serializ...
Citations
| 1320 | Concurrency Control and Recovery in Database Systems – Bernstein, Hadzilacos, et al. - 1987 |
| 1 | Record Operations – Singleton |
| 1 | Valued Ranges – Key |
| 1 | Lock Modes for Changing Ranges : : : : : : : : : : : : : 10 4 Common Resources for Reduced Locking 12 – New |
| 1 | Value Locks(KVL – Key |
