Backend
Optimizing Geo-replicated Deterministic Databases
arXiv cs.DB0 views
arXiv:2611.05882v1 Announce Type: new Abstract: In transactional databases, achieving active-active replication among geo-distributed replicas is challenging due to the high coordination cost in ensuring the serializability of concurrent cross-node transactions. Deterministic concurrency control (DCC) has emerged as a promising alternative: it establishes a global order for a batch of transactions before execution and thereby amortizes this coordination cost across the batch. To better understand the performance characteristics of DCC, we conduct a theoretical analysis of traditional two-phase locking and optimistic concurrency control to account for geo-replication and introduce a model for DCC. We compare the three paradigms and identify the conditions under which DCC is advantageous. Guided by the insights from this analysis, we then present Quirinus, a DCC-based geo-replicated database that optimizes transaction execution through speculative execution, transaction reordering, integration of conflict-free replicated data types (CRDTs), and fast-path commit. Even without these optimizations, Quirinus achieves up to 6.2x the TPC-C throughput of Tiga under our configuration.
Source:https://arxiv.org/abs/2611.05882PreviousWhiel: A Neurosymbolic Platform for Certified Relational Program VerificationNextWhen Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware
Related posts
How to let Claude Code and Codex talk directly across two computers without copy-pasting logs
0dev.to
Why Is There a Delay When I’m Typing? (I Tested the Bottlenecks So You Don’t Have To)
0dev.to

Moving City GIS Into Unreal Engine: Coordinate Systems, LOD, and the Boring Parts
0dev.to
My AI Agent Said 'Done.' It Wasn't. A Field Guide to Trusting Nothing an Agent Tells You
0dev.to
Bridging Context and Execution: An Engineering Assessment of Connected AI Workflows
0dev.to
把 AI CLI 包成 OpenAI 相容 API:從 stdin、JSON 輸出到逾時處理(附可跑範例)
0dev.to