Reinforcement Learning Query Planning for Cluster Load Stability

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Determining the optimal number of concurrent tasks for database query execution on computing clusters is challenging due to dynamically changing computing loads, making it difficult to avoid overloading and maintaining performance.

Innovation Solution

Implementing a query resource database system with a resource profile prediction engine and an assignment decider engine to predict resource requirements and manage query assignments based on database resource data, optimizing query scheduling on multi-server clusters.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If more concurrent tasks are executed on computing clusters, then productivity increases, but system stability deteriorates due to dynamically changing computing loads and risk of overload

Engineering Contradiction:
Improvequery processing throughputVSAvoidsystem stability
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The system continuously monitors computing load metrics (CPU utilization, memory usage, I/O operations) and uses this feedback to dynamically adjust the number of concurrent query tasks. When load exceeds thresholds, the system reduces task allocation; when load is low, it increases allocation, creating a closed-loop control system that maintains stability while maximizing throughput

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The system transitions from static task allocation to dynamic task allocation based on real-time computing conditions. The query optimizer adapts the degree of parallelism and resource allocation dynamically according to current system state, allowing the system to respond flexibly to changing workloads and maintain optimal performance across varying conditions

Inventive Principle:
Principle #15Dynamics

2Productivity

If more concurrent tasks are executed on computing clusters, then productivity increases, but device complexity increases due to difficulty in determining optimal task ordering and plan selection

Engineering Contradiction:
Improvequery processing throughputVSAvoidquery execution planning complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The query optimization system performs self-tuning by automatically learning from historical execution data and performance metrics. The system autonomously adjusts optimization parameters, selects execution plans, and determines task ordering without manual intervention, using machine learning models that continuously improve based on observed system behavior and query patterns

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The system pre-computes and caches optimal execution plans for common query patterns based on historical data analysis. Before executing queries, the system retrieves pre-prepared plans and adjusts them minimally for current conditions, avoiding the need to perform complex optimization calculations in real-time and reducing planning complexity

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS12579145B2Query-execution planning using reinforcement learning
Publication Date: 2026.03.17 SNOWFLAKE INC
  • US12579145B2 patent drawing
  • US12579145B2 patent drawing
  • US12579145B2 patent drawing

AI summary

A method for improving query scheduling on a computing cluster using reinforcement learning is provided. A series of queries to be executed using resources of the computing cluster is received. For each query, a query execution plan is generated and a resource profile for executing the query is predicted. Current state data of the cluster resources is received and assignment data to execute the query on the cluster resources is generated by applying the reinforcement learning technique. The query is executed on the computing cluster based on the generated assignment data, and query results are stored.