Oze: Decentralized Graph-based Concurrency Control for Long-running Update Transactions (Extended Version)
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913976629067776 |
|---|---|
| author | Nemoto, Jun Kambayashi, Takashi Hoshino, Takashi Kawashima, Hideyuki |
| author_facet | Nemoto, Jun Kambayashi, Takashi Hoshino, Takashi Kawashima, Hideyuki |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_04179 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Oze: Decentralized Graph-based Concurrency Control for Long-running Update Transactions (Extended Version) Nemoto, Jun Kambayashi, Takashi Hoshino, Takashi Kawashima, Hideyuki Databases 97P30 H.2.4 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. |
| title | Oze: Decentralized Graph-based Concurrency Control for Long-running Update Transactions (Extended Version) |
| topic | Databases 97P30 H.2.4 |
| url | https://arxiv.org/abs/2210.04179 |