Hybrid Concurrency Control for Abstract Data Types (Extended Abstract)
Summary: Hybrid locking protocol for ADTs that uses commit-generated timestamps to infer serialization order, permits partial/non-deterministic operations and lock choices based on operation results, and derives conflict constraints from ADT specs. Formal CC+recovery semantics with proof of hybrid atomicity and optimality—no hybrid-atomic locking scheme can allow more concurrency. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,431 | ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior | 1990 | SIGMOD | 8.8329645e-05 |
| 2,710 | Towards a Unified Theory of Concurrency Control and Recovery | 1993 | PODS | 8.2504476e-05 |
| 3,533 | Extracting Concurrency from Objects: A Methodology | 1991 | SIGMOD | 7.0009039e-05 |
| 5,500 | A Formalism for Extended Transaction Models | 1991 | VLDB | 5.4744227e-05 |
| 7,244 | Non-Deterministic Queue Operations | 1991 | PODS | 4.7910746e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next