An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems

Authors:
Eljas Soisalon-Soininen;Derick Wood
Affiliations:
University of Helsinki, Helsinki, Finland;McMaster University, Hamilton, Ontario, Canada
Venue:
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Year:
1982

Citing 2
Cited 5

The notions of consistency and predicate locks in a database system

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

An Example of Deriving Performance Properties from a Visual Representation of Program Execution

IEEE Transactions on Parallel and Distributed Systems
Freedom from deadlock of locked transactions in a distributed database

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Geometry and concurrency: a user's guide

Mathematical Structures in Computer Science
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles

Information Processing Letters
Foundations of data-aware process analysis: a database theory perspective

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various notions are introduced for the closure of a set of rectilinearly oriented rectangles on the plane. Optimal algorithms are presented for computing the closures. These algorithms imply optimal solutions to several problems related to database concurrency control.