On the public citation graph

Freedom from Deadlock of Safe Locking Policies

https://doi.org/10.1137/0211031
0 signed · 23 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00263762openalex-snapshot
Concurrency of operations on B-trees
inferredcites →https://doi.org/10.1016/0020-0190(76)90005-3openalex-snapshot
B-trees in a system with multiple users
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/322169.322176openalex-snapshot
Consistency in Hierarchical Database Systems
inferredcites →https://doi.org/10.1145/322326.322333openalex-snapshot
A Theory of Safe Locking Policies in Database Systems
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-13883-8_81openalex-snapshot
Eliminating cascading rollback in structured databases
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_52openalex-snapshot
A new characterization of distributed deadlock in databases
inferred← citeshttps://doi.org/10.1007/bfb0036467openalex-snapshot
Theory of concurrency control
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90099-8openalex-snapshot
Concurrent execution of transaction copies
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90078-3openalex-snapshot
Is distributed locking harder?
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90017-6openalex-snapshot
Deadlock-freedom (and safety) of transactions in a distributed database
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90028-7openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90043-xopenalex-snapshot
An algorithm for early unlocking of entities in database transactions
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90049-6openalex-snapshot
The virtues of locking by symbolic names
inferred← citeshttps://doi.org/10.1016/b978-0-444-70409-2.50028-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80024-8openalex-snapshot
On the complexity of concurrency control by locking in distributed database systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80005-5openalex-snapshot
Pre-analysis locking
inferred← citeshttps://doi.org/10.1145/588011.588018openalex-snapshot
Maximal concurrency by locking
inferred← citeshttps://doi.org/10.1145/588011.588019openalex-snapshot
Concurrency control in graph protocols by using edge locks
inferred← citeshttps://doi.org/10.1145/6012.15403openalex-snapshot
Safety of non-well-locked transaction systems
inferred← citeshttps://doi.org/10.1145/800221.806727openalex-snapshot
Freedom from deadlock of locked transactions in a distributed database
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.