Concurrency Control by Locking
Copyright policy )Concurrency Control by Locking
We present a geometric method for studying concurrency control by locking. When there are only two transactions, our method yields an exact characterization of safe locking policies and also of deadlock-free locking policies. Our results can be extended to more than two transactions, but in that case the problem becomes NP-complete.
safety, concurrency control, transaction, Analysis of algorithms and problem complexity, two-phase locking, Theory of operating systems, Information storage and retrieval of data, data base, geometry of locking
safety, concurrency control, transaction, Analysis of algorithms and problem complexity, two-phase locking, Theory of operating systems, Information storage and retrieval of data, data base, geometry of locking
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).18 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!