Is distributed locking harder?

DOI10.1016/0022-0000(84)90078-3MaRDI QIDQ1061510zbMATH OpenOpenAlexFDO

Authors Paris C. Kanellakis, Christos Papadimitriou

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0022-0000(84)90078-3

zbMATH Keywords

concurrency controldistributed databasecoNP-completegraph-theoretic techniquelocked transactionsserializable schedules

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the power of safe locking
• Deadlock-freedom (and safety) of transactions in a distributed database
• The Complexity of Distributed Concurrency Control
• Problems in transaction concurrency control algorithms
• scientific article; zbMATH DE number 4033153

Cites work

• scientific article; zbMATH DE number 3648167 (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 locking protocol for resource coordination in distributed databases
• A theorem in database concurrency control
• Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres
• Concurrency Control by Locking
• Consistency in Hierarchical Database Systems
• Freedom from Deadlock of Safe Locking Policies
• On the complexity of some two-person perfect-information games
• The notions of consistency and predicate locks in a database system
• Transactions and consistency in distributed database systems

Cited in

(9)

• An algorithm for early unlocking of entities in database transactions
• Concurrent execution of transaction copies
• A note on the transaction backout problem
• Scalable hierarchical locking for distributed systems
• scientific article; zbMATH DE number 4049029 (Why is no real title available?)
• Deadlock-freedom (and safety) of transactions in a distributed database
• Distributed Computing - IWDC 2003
• Multiserialization of iterated transactions
• Locking based on a pairwise decomposition of the transaction system

Describes a project that uses

Uses Software

• INGRES

This page was built for publication: Is distributed locking harder?

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