On the public citation graph
Serializability by Locking
0 signed · 77 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/sfcs.1976.12openalex-snapshot
Concurrency control for database systems
inferredcites →https://doi.org/10.1109/sfcs.1979.12openalex-snapshot
Controlling concurrency using locking protocols
inferredcites →https://doi.org/10.1109/sfcs.1979.22openalex-snapshot
Locking policies: Safety and freedom from deadlock
inferredcites →https://doi.org/10.1109/tse.1979.234182openalex-snapshot
Formal Aspects of Serializability in Database Concurrency Control
inferredcites →https://doi.org/10.1145/319566.319567openalex-snapshot
On optimistic methods for concurrency control
inferredcites →https://doi.org/10.1145/320107.320126openalex-snapshot
Comments on “Process synchronizaiton in databases systems”
inferredcites →https://doi.org/10.1145/320128.320133openalex-snapshot
The correctness of concurrency control mechanisms in a system for distributed databases (SDD-1)
inferredcites →https://doi.org/10.1145/320263.320279openalex-snapshot
Process synchronization in database systems
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/322344.322349openalex-snapshot
A theorem in database concurrency control
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1145/509252.509258openalex-snapshot
Consistency, concurrency, and crash recovery
inferredcites →https://doi.org/10.1145/582095.582114openalex-snapshot
An optimality theory of concurrency control for databases
inferredcites →https://doi.org/10.1145/588111.588157openalex-snapshot
Compatibility and commutativity in non-two-phase locking protocols
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1984.tb00089.xopenalex-snapshot
Papers by AT&T Bell Laboratories Authors
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_18openalex-snapshot
A simple characterization of database serializability
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_81openalex-snapshot
Strictness and serializability
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_36openalex-snapshot
Update serializability in locking
inferred← citeshttps://doi.org/10.1007/3-540-18625-5_55openalex-snapshot
Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols
inferred← citeshttps://doi.org/10.1007/3-540-50171-1_23openalex-snapshot
Conceptual level concurrency control of relational update transactions
inferred← citeshttps://doi.org/10.1007/3-540-50171-1_24openalex-snapshot
Version consistency and serializability in design databases
inferred← citeshttps://doi.org/10.1007/3-540-51251-9_21openalex-snapshot
Locking policies and predeclared transactions
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_722openalex-snapshot
Correctness Criteria Beyond Serializability
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_722openalex-snapshot
Correctness Criteria Beyond Serializability
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_722-2openalex-snapshot
Correctness Criteria Beyond Serializability
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_10openalex-snapshot
In the Search for Optimal Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_33openalex-snapshot
Toward a Theory of Input Acceptance for Transactional Memories
inferred← citeshttps://doi.org/10.1007/978-3-7091-7553-8_32openalex-snapshot
Dynamic Scheduling of Transactions in Design Databases based on Version Consistency
inferred← citeshttps://doi.org/10.1007/bf00290709openalex-snapshot
Generalized theory of serializability
inferred← citeshttps://doi.org/10.1007/s007780050017openalex-snapshot
A taxonomy of correctness criteria in database applications
inferred← citeshttps://doi.org/10.1016/0020-0255(88)90017-5openalex-snapshot
A Dynamic majority determination algorithm for reconfiguration of network partitions
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90014-copenalex-snapshot
On the power of safe locking
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90034-iopenalex-snapshot
Commutativity-based locking for nested transactions
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90030-eopenalex-snapshot
Locking based on a pairwise decomposition of the transaction system
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/0304-3975(89)90090-xopenalex-snapshot
Algebraic specification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90065-nopenalex-snapshot
Conceptual level concurrency control of relational update transactions
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90015-hopenalex-snapshot
Concurrency control for a mix of universioned and multiversioned entities in distributed databases
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80201-4openalex-snapshot
Chapter 4 Databases and database management
inferred← citeshttps://doi.org/10.1080/07421222.1987.11517795openalex-snapshot
Transaction Processing and Consistency Control of Replicated Copies during Failures in Distributed Databases
inferred← citeshttps://doi.org/10.1109/icics.1997.652091openalex-snapshot
User defined prewrites for increasing concurrency in design databases
inferred← citeshttps://doi.org/10.1109/ideas.2000.880589openalex-snapshot
Concurrency control for B-trees with differential indices
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492479openalex-snapshot
Perspectives on database theory
inferred← citeshttps://doi.org/10.1109/tsmca.2008.923043openalex-snapshot
Extending WebDAV With Multiple-Granularity Locking
inferred← citeshttps://doi.org/10.1142/s0129626410000041openalex-snapshot
ON THE INPUT ACCEPTANCE OF TRANSACTIONAL MEMORY
inferred← citeshttps://doi.org/10.1145/103140.103145openalex-snapshot
Principles and realization strategies of multilevel transaction management
inferred← citeshttps://doi.org/10.1145/1804669.1804677openalex-snapshot
A theoretical study of 'Snapshot Isolation'
inferred← citeshttps://doi.org/10.1145/235666.235670openalex-snapshot
Perspectives on database theory
inferred← citeshttps://doi.org/10.1145/298514.298545openalex-snapshot
Locks with constrained sharing (extended abstract)
inferred← citeshttps://doi.org/10.1145/3552326.3567492openalex-snapshot
Viper: A Fast Snapshot Isolation Checker
inferred← citeshttps://doi.org/10.1145/3651592openalex-snapshot
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control
inferred← citeshttps://doi.org/10.1145/42267.42272openalex-snapshot
A theory of reliability in database systems
inferred← citeshttps://doi.org/10.1145/588011.588057openalex-snapshot
Towards a theory of online schedulers
inferred← citeshttps://doi.org/10.1145/6012.15401openalex-snapshot
A theoretical foundation of multi-level concurrency control
inferred← citeshttps://doi.org/10.1145/6012.15403openalex-snapshot
Safety of non-well-locked transaction systems
inferred← citeshttps://doi.org/10.13140/rg.2.2.24183.42408openalex-snapshot
Concurrency in Transactional Memory
inferred← citeshttps://doi.org/10.1504/ijcse.2010.037678openalex-snapshot
Speculation-based protocols for improving the performance of read-only transactions
inferred← citeshttps://doi.org/10.22028/d291-23751openalex-snapshot
Transaktionen in föderierten Datenbanksystemen unter eingeschränkten Isolation Levels
inferred← citeshttps://doi.org/10.31274/rtd-180813-9224openalex-snapshot
Transaction and data models for design databases
inferred← citeshttps://doi.org/10.48550/arxiv.1003.4830openalex-snapshot
Limits of Commutativity on Abstract Data Types
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4751openalex-snapshot
Optimism for Boosting Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1912.09018openalex-snapshot
Detecting Incorrect Behavior of Cloud Databases as an Outsider
inferred← citeshttps://doi.org/10.5555/285730.285788openalex-snapshot
Concurrency control in a VLSI design database
inferred← citeshttps://doi.org/10.5860/choice.39-2844openalex-snapshot
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
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.