On the public citation graph
Distributed concurrency control based on limited wait-depth
0 signed · 42 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.1007/978-1-4020-9688-4_4openalex-snapshot
System Level Concurrency Control for Distributed Database Systems
inferredcites →https://doi.org/10.1016/0306-4379(84)90020-6openalex-snapshot
Observations on optimistic concurrency control schemes
inferredcites →https://doi.org/10.1016/c2013-0-11587-5openalex-snapshot
Locking Performance in Centralized Databases
inferredcites →https://doi.org/10.1109/32.4675openalex-snapshot
A performance comparison of multimicro and mainframe database architectures
inferredcites →https://doi.org/10.1109/32.90443openalex-snapshot
Performance analysis of two-phase locking
inferredcites →https://doi.org/10.1109/69.43427openalex-snapshot
Locking performance in a shared nothing parallel database machine
inferredcites →https://doi.org/10.1109/71.205656openalex-snapshot
Determining the number of remote sites accessed in distributed transaction processing
inferredcites →https://doi.org/10.1109/icdcs.1990.89296openalex-snapshot
A new distributed optimistic concurrency control method and a comparison of its performance with two-phase locking
inferredcites →https://doi.org/10.1109/icde.1990.113453openalex-snapshot
Access invariance and its use in high contention environments
inferredcites →https://doi.org/10.1109/icde.1991.131456openalex-snapshot
Wait depth limited concurrency control
inferredcites →https://doi.org/10.1109/icde.1991.131491openalex-snapshot
Performance limits of two-phase locking
inferredcites →https://doi.org/10.1109/ride.1992.227405openalex-snapshot
Less optimism about optimistic concurrency control
inferredcites →https://doi.org/10.1145/128903.128906openalex-snapshot
Concurrency control for high contention environments
inferredcites →https://doi.org/10.1145/133057.133095openalex-snapshot
Performance analysis of locking policies with limited wait depth
inferredcites →https://doi.org/10.1145/3148.3160openalex-snapshot
Limitations of concurrency in transaction processing
inferredcites →https://doi.org/10.1145/32204.32220openalex-snapshot
Concurrency control performance modeling: alternatives and implications
inferredcites →https://doi.org/10.1145/4879.4880openalex-snapshot
Locking performance in centralized databases
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-44759-8_91openalex-snapshot
A New Look at Timestamp Ordering Concurrency Control
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_14openalex-snapshot
Performance Analysis of Concurrency Control Methods
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_26openalex-snapshot
Performance Studies of Shared-Nothing Parallel Transaction Processing Systems
inferred← citeshttps://doi.org/10.1007/3-540-63371-5_29openalex-snapshot
Scheduling algorithms for parallel transaction processing systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35360-9_9openalex-snapshot
Performance Study of Shared-Nothing Parallel Transaction Processing Systems
inferred← citeshttps://doi.org/10.1007/bf02948850openalex-snapshot
A non-blocking locking method and performance evaluation on network of workstations
inferred← citeshttps://doi.org/10.1016/j.parco.2022.102980openalex-snapshot
SGPM: A coroutine framework for transaction processing
inferred← citeshttps://doi.org/10.1016/s0166-5316(98)00025-xopenalex-snapshot
Performance analysis of locking methods with limited wait depth
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00019-7openalex-snapshot
Simulation studies on concurrency control in parallel transaction processing systems
inferred← citeshttps://doi.org/10.1093/comjnl/38.9.717openalex-snapshot
Stochastic Petri Net Analysis of Deadlock Detection Algorithms in Transaction Database Systems with Dynamic Locking
inferred← citeshttps://doi.org/10.1109/69.382303openalex-snapshot
Checkpointing for optimistic concurrency control methods
inferred← citeshttps://doi.org/10.1109/69.599931openalex-snapshot
A performance comparison of locking methods with limited wait depth
inferred← citeshttps://doi.org/10.1109/69.667102openalex-snapshot
Distributed optimistic concurrency control methods for high-performance transaction processing
inferred← citeshttps://doi.org/10.1109/ftcs.1994.315629openalex-snapshot
A study of throughput degradation following single node failure in a data sharing system
inferred← citeshttps://doi.org/10.1109/icccn.1998.998858openalex-snapshot
Design issues of an efficient distributed database scheduler for telecom
inferred← citeshttps://doi.org/10.1109/icdcs.1992.235043openalex-snapshot
Distributed concurrency control with limited wait-depth
inferred← citeshttps://doi.org/10.1109/ispdc.2003.1267645openalex-snapshot
Performance analysis of speculative concurrency control algorithms based on wait depth limited for distributed database systems
inferred← citeshttps://doi.org/10.1109/naecon.1997.617778openalex-snapshot
An effective scheduling algorithm for parallel transaction processing systems
inferred← citeshttps://doi.org/10.1109/tc.2004.1261837openalex-snapshot
A general stochastic model for dynamic locking in database systems
inferred← citeshttps://doi.org/10.1145/1138085.1138091openalex-snapshot
Multi-level RAID for very large disk arrays
inferred← citeshttps://doi.org/10.1145/126482.126495openalex-snapshot
Centralized concurrency control methods for high-end TP
inferred← citeshttps://doi.org/10.18130/v3pb7mopenalex-snapshot
Network-Aided Concurrency Control in Distributed Databases
inferred← citeshttps://doi.org/10.24124/2009/bpgub585openalex-snapshot
Priority-based speculative locking protocols for distributed real-time database systems.
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.