On the power of safe locking

DOI10.1016/0022-0000(90)90014-CMaRDI QIDQ909495zbMATH OpenFDO

Authors Eljas Soisalon-Soininen, Peter Widmayer, Georg Lausen

Publication date 1990

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

lockingalgorithmscheduledatabase concurrency controltransaction systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Safe locking policies for dynamic databases
• Locking based on a pairwise decomposition of the transaction system
• Safety by uninterpreted locks
• Deadlock-freedom (and safety) of transactions in a distributed database
• Constrained shared locks for increasing concurrency in databases

Cites work

• scientific article; zbMATH DE number 4028947 (Why is no real title available?)
• scientific article; zbMATH DE number 3714911 (Why is no real title available?)
• A Theory of Safe Locking Policies in Database Systems
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• A theorem in database concurrency control
• Concurrency Control by Locking
• On the definition and computation of rectilinear convex hulls
• Optimal algorithms to compute the closure of a set of iso-rectangles
• Serializability by Locking
• The notions of consistency and predicate locks in a database system
• The serializability of concurrent database updates

Cited in

(13)

• Locking based on a pairwise decomposition of the transaction system
• A superior two-phase locking algorithm amd its performance
• Beyond two-phase locking
• Is distributed locking harder?
• Pre-analysis locking
• Locks, Bombs and Testing: The Case of Independent Locks
• Constrained shared locks for increasing concurrency in databases
• Multi-granularity locking for nested transactions: A proof using a possibilities mapping
• Concurrent execution of transaction copies
• An algorithm for early unlocking of entities in database transactions
• Safety by uninterpreted locks
• The virtues of locking by symbolic names
• 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)

This page was built for publication: On the power of safe locking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q909495)