Abstract
Quantum annealers are a special kind of quantum computers for solving optimization problems. In this paper, we investigate the benefits of quantum annealers in the field of transaction synchronization. In particular, we show how transactions using the 2-phase-locking protocol can be optimally distributed to any number of available machines to reduce transaction waiting times. Therefore an instance of the problem will be transformed into a formula that is accepted by quantum annealers. In an experimental evaluation, the runtime on a quantum annealer outperforms the runtime of traditional algorithms to solve combinatorial problems like simulated annealing already for small problem sizes.
| Original language | English |
|---|---|
| Title of host publication | IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications |
| Number of pages | 10 |
| Place of Publication | New York |
| Publisher | Association for Computing Machinery |
| Publication date | 12.08.2020 |
| Pages | 1–10 |
| Article number | 3410593 |
| ISBN (Print) | 978-145037503-0 |
| DOIs | |
| Publication status | Published - 12.08.2020 |
| Event | 24th International Database Engineering & Applications Symposium - Seoul, Korea, Republic of Duration: 12.08.2020 → 14.08.2020 |
Research Areas and Centers
- Centers: Center for Artificial Intelligence Luebeck (ZKIL)
- Research Area: Intelligent Systems
DFG Research Classification Scheme
- 4.43-03 Security and Dependability, Operating, Communication and Distributed Systems
