CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.
citing papers explorer
-
CV-Rules: Serializability Verification of Concurrency Control Protocols via Explicit Transaction Ordering
CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
-
One Ring to Shuffle Them All: Scalable Intra-Process Data Redistribution with Ring-Buffer Shuffle in Redpanda Oxla
Ring-buffer shuffle achieves amortized O(1) synchronization per batch and O(M) memory use, outperforming prior methods by up to 300% on 192-core systems in query engine benchmarks.