Is distributed locking harder?

DOI10.1016/0022-0000(84)90078-3zbMath0571.68083OpenAlexW1963591123MaRDI QIDQ1061510

Paris C. Kanellakis, Christos H. 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

distributed databaseconcurrency controlcoNP-completegraph-theoretic techniquelocked transactionsserializable schedules

Mathematics Subject Classification ID

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) Information storage and retrieval of data (68P20)

Related Items (3)

Concurrent execution of transaction copies ⋮ Deadlock-freedom (and safety) of transactions in a distributed database ⋮ Multiserialization of iterated transactions

Uses Software

• INGRES

Cites Work

• Unnamed Item
• On the complexity of some two-person perfect-information games
• Concurrency Control by Locking
• Consistency in Hierarchical Database Systems
• A locking protocol for resource coordination in distributed databases
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• Freedom from Deadlock of Safe Locking Policies
• Transactions and consistency in distributed database 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
• Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres

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