Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning

Performance of worst-case optimal join algorithms depends on the order in which the join attributes are processed. It is challenging to identify suitable orders prior to query execution due to the huge search space of possible orders and unreliable execution cost estimates in case of data skew or data correlation. We demonstrate ADOPT, a novel query engine that integrates adaptive query processing with a worst-case optimal join algorithm. ADOPT divides query execution into episodes, during which different attribute orders are invoked. With runtime feedback on performance of different attribute orders, ADOPT rapidly approaches near-optimal orders. Moreover, ADOPT uses a unique data structure which keeps track of the processed input data to prevent redundant work across different episodes. It selects attribute orders to try via reinforcement learning, balancing the need for exploring new orders with the desire to exploit promising orders. In experiments, ADOPT outperforms baselines, including commercial and open-source systems utilizing worst-case optimal join algorithms, particularly for complex queries that are difficult to optimize.

Automated summary

The performance of worst-case optimal join algorithms depends on the order in which the join attributes are processed. It is challenging to determine suitable orders prior to query execution due to the large search space and unreliable cost estimates. This article introduces ADOPT, a query engine that combines adaptive query processing with a worst-case optimal join algorithm. ADOPT divides query execution into episodes and rapidly approaches near-optimal orders with runtime feedback. It also utilizes a unique data structure to prevent redundant work and selects attribute orders using reinforcement learning.