论文标题
Oze：长期运行更新交易的分散图基于图的并发控制（扩展版）
Oze: Decentralized Graph-based Concurrency Control for Long-running Update Transactions (Extended Version)
论文作者
论文摘要
本文提出了Oze，这是一种处理异质工作负载的并发控制协议，包括长期运行的更新交易。 Oze使用多次序列化图探索了大型调度空间，以减少误报。 Oze以分散的方式管理图表，以利用现代服务器中的许多核心。我们进一步根据实际制造公司的用例提出了OLTP基准，炸弹（材料法案基准）。炸弹包括一项长期运行的更新交易和五项彼此冲突的短交易。使用炸弹的实验表明，Oze可以处理长期运行的更新交易，同时达到四个数量级的吞吐量，比最先进的乐观和多次反复协议高出四个数量级，并且吞吐量高五倍。由于协议切换机制，我们还可以表明，即使在典型的OLTP工作负载，TPC-C中，Oze的性能也相当。
This paper proposes Oze, a concurrency control protocol that handles heterogeneous workloads, including long-running update transactions. Oze explores a large scheduling space using a multi-version serialization graph to reduce false positives. Oze manages the graph in a decentralized manner to exploit many cores in modern servers. We further propose an OLTP benchmark, BoMB (Bill of Materials Benchmark), based on a use case in an actual manufacturing company. BoMB consists of one long-running update transaction and five short transactions that conflict with each other. Experiments using BoMB show that Oze can handle the long-running update transaction while achieving four orders of magnitude higher throughput than state-of-the-art optimistic and multi-version protocols and up to five times higher throughput than pessimistic protocols. We also show Oze performs comparably with existing techniques even in a typical OLTP workload, TPC-C, thanks to a protocol switching mechanism.
