Learning State Representations for Query Optimization with Deep Reinforcement Learning
Deep reinforcement learning is quickly changing the field of artificial intelligence. These models are able to capture a high level understanding of their environment, enabling them to learn difficult dynamic tasks in a variety of domains. In the database field, query optimization remains a difficult problem. Our goal in this work is to explore the capabilities of deep reinforcement learning in the context of query optimization. At each state, we build queries incrementally and encode properties of subqueries through a learned representation. The challenge here lies in the formation of the state transition function, which defines how the current subquery state combines with the next query operation (action) to yield the next state. As a first step in this direction, we focus the state representation problem and the formation of the state transition function. We describe our approach and show preliminary results. We further discuss how we can use the state representation to improve query optimization using reinforcement learning.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Similar Papers 제목 키워드 기반
When should I search more: Adaptive Complex Query Optimization with Reinforcement Learning
Query optimization is a crucial component for the efficacy of Retrieval-Augmented Generation (RAG) systems. While reinforcement learning (RL)-based agentic and reasoning methods have recently emerged as a promising direc…
Computational EfficiencyReinforcement LearningJoin Query Optimization with Deep Reinforcement Learning Algorithms
Join query optimization is a complex task and is central to the performance of query processing. In fact it belongs to the class of NP-hard problems. Traditional query optimizers use dynamic programming (DP) methods comb…
AttributeDeep Reinforcement LearningEnsemble LearningQ-Learning+3JoinGym: An Efficient Query Optimization Environment for Reinforcement Learning
Join order selection (JOS) is the problem of ordering join operations to minimize total query execution cost and it is the core NP-hard combinatorial optimization problem of query optimization. In this paper, we present …
BenchmarkingCombinatorial OptimizationManagementreinforcement-learning+2The Unreasonable Effectiveness of LLMs for Query Optimization
Recent work in database query optimization has used complex machine learning strategies, such as customized reinforcement learning schemes. Surprisingly, we show that LLM embeddings of query text contain useful semantic …
Learning and Querying Fast Generative Models for Reinforcement Learning
A key challenge in model-based reinforcement learning (RL) is to synthesize computationally efficient and accurate environment models. We show that carefully designed generative models that learn and operate on compact s…
Atari GamesDecision MakingModel-based Reinforcement Learningreinforcement-learning+3