Fast General Distributed Transactions with Opacity
Summary: Extends FaRM to provide opacity (strict serializability for committed and aborted txs) while preserving high throughput and availability in data centers. Real-time microsecond-clock synchronization with clock-master failover enables 5.4M new-order txs/sec on 90 nodes with 3-way replication under TPC-C. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alex Shamis (Imperial College London; Microsoft)
- 2. Matthew Renzelmann (Microsoft)
- 3. Stanko Novakovic (Microsoft; VMware)
- 4. Georgios Chatzopoulos (EPFL; Microsoft)
- 5. Aleksandar Dragojevic (Microsoft)
- 6. Dushyanth Narayanan (Microsoft)
- 7. Miguel Castro (Microsoft)
BibTeX Citation
@inproceedings{shamis_sigmod19,
title = {{Fast General Distributed Transactions with Opacity}},
author = {Shamis, Alex and Renzelmann, Matthew and Novakovic, Stanko and Chatzopoulos, Georgios and Dragojevic, Aleksandar and Narayanan, Dushyanth and Castro, Miguel},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3300069},
url = {https://dl.acm.org/doi/10.1145/3299869.3300069},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 38 | Hekaton: SQL Server’s Memory-Optimized OLTP Engine | 2013 | SIGMOD | 0.00047648573 |
| 57 | Calvin: Fast Distributed Transactions for Partitioned Database Systems | 2012 | SIGMOD | 0.00040139242 |
| 172 | High-Performance Concurrency Control Mechanisms for Main-Memory Databases | 2012 | VLDB | 0.00027281663 |
| 1,345 | The End of a Myth: Distributed Transactions Can Scale | 2017 | VLDB | 0.00011090483 |
| 1,731 | Write-Optimized B-Trees | 2004 | VLDB | 9.9081882e-05 |
| 1,926 | An Evaluation of Distributed Concurrency Control | 2017 | VLDB | 9.4705999e-05 |
| 3,661 | Sundial: Harmonizing Concurrency Control and Caching in a Distributed OLTP Database Management System | 2018 | VLDB | 7.2167755e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,292 | An Optimistic Commit Protocol for Distributed Transaction Management | 1991 | SIGMOD |
| 2 | 5,934 | Semantics Based Transaction Management Techniques for Replicated Data | 1988 | SIGMOD |
| 3 | 3,687 | MaaT: Effective and scalable coordination of distributed transactions in the cloud | 2014 | VLDB |
| 4 | 4,829 | Strong consistency is not hard to get: Two-Phase Locking and Two-Phase Commit on Thousands of Cores | 2019 | VLDB |
| 5 | 1,345 | The End of a Myth: Distributed Transactions Can Scale | 2017 | VLDB |
| 6 | 2,497 | Low-Latency Multi-Datacenter Databases using Replicated Commit | 2013 | VLDB |
| 7 | 11,514 | Decoupled Transactions: Low Tail Latency Online Transactions Atop Jittery Servers | 2022 | CIDR |
| 8 | 4,419 | Revisiting Commit Processing in Distributed Database Systems | 1997 | SIGMOD |
| 9 | 1,187 | Highly Available Transactions: Virtues and Limitations | 2014 | VLDB |
| 10 | 7,736 | How Fast can a Distributed Transaction Commit? | 2017 | PODS |