On the power of safe locking

DOI10.1016/0022-0000(90)90014-CzbMath0694.68066MaRDI QIDQ909495

Peter Widmayer, Eljas Soisalon-Soininen, Georg Lausen

Publication date: 1990

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

zbMATH Keywords

algorithmschedulelockingdatabase concurrency controltransaction systems

Mathematics Subject Classification ID

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

Related Items (1)

Locking based on a pairwise decomposition of the transaction system

Cites Work

• Unnamed Item
• Unnamed Item
• On the definition and computation of rectilinear convex hulls
• Optimal algorithms to compute the closure of a set of iso-rectangles
• Concurrency Control by Locking
• Serializability by Locking
• The serializability of concurrent database updates
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• A Theory of Safe Locking Policies in Database Systems
• A theorem in database concurrency control
• The notions of consistency and predicate locks in a database system

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