Abstract
The optimization of queries speeds up query processing in databases. One of the most time-consuming tasks in query processing is the join operation, where the order of the joins plays a crucial role in determining the number of tuples to be processed for intermediate results, and hence, the overall processing costs. In this paper, we use a variational quantum circuit (VQC) to create a hybrid classical-quantum machine learning algorithm to predict efficient join orders by learning from past join orders. We develop an encoding of the join order problem using a low number of qubits. We show that VQCs with filtering of cross joins outperform the classical dynamic programming optimizer of PostgreSQL with a 2.7\% faster execution time.
| Original language | English |
|---|---|
| Title of host publication | BiDEDE@SIGMOD |
| Number of pages | 7 |
| Publication date | 2023 |
| Pages | 5:1-5:7 |
| DOIs | |
| Publication status | Published - 2023 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 4 Quality Education
-
SDG 9 Industry, Innovation, and Infrastructure
-
SDG 11 Sustainable Cities and Communities
-
SDG 12 Responsible Consumption and Production
-
SDG 14 Life Below Water
-
SDG 15 Life on Land
Research Areas and Centers
- Centers: Center for Artificial Intelligence Luebeck (ZKIL)
- Research Area: Intelligent Systems
DFG Research Classification Scheme
- 409-06 Information Systems, Process and Knowledge Management
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver