SQL Query Optimization via Union Operator Elimination

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Database management systems (DBMSs) face inefficiencies when processing complex SQL queries with Union operators, particularly when sub-queries perform redundant operations and duplicative table accesses, leading to sub-optimal query execution plans.

Innovation Solution

The DBMS employs query transformation techniques to eliminate Union operators by determining if sub-queries match exactly, share the same Group By partitioning columns, use identical algebraic functions, and are not referenced elsewhere in the query, transforming such queries to remove redundant operations and optimize performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the DBMS processes complex SQL queries with Union operators and multiple Group By operations, then the query can handle diverse data aggregation scenarios, but the query execution performance deteriorates due to redundant operations and duplicative table accesses

Engineering Contradiction:
Improvequery handling capabilityVSAvoidquery execution performance
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent merges identical Group By operations from multiple sub-queries into a single operation. When the query optimizer detects that sub-queries have identical Group By clauses and algebraic functions, it consolidates them into one execution unit, eliminating redundant computations and improving performance while preserving the ability to handle diverse aggregation scenarios

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The query optimizer performs preliminary analysis of the SQL query structure before execution, identifying identical Group By operations and algebraic functions across sub-queries. This preliminary detection and transformation phase prepares an optimized query execution plan that avoids redundant operations during actual query execution

Inventive Principle:
Principle #10Preliminary action

2Reliability

If the query includes multiple sub-queries with identical algebraic functions and Group By operations, then the query can perform comprehensive data analysis, but the resource usage increases due to redundant computations

Engineering Contradiction:
Improvedata analysis completenessVSAvoidcomputational resource usage
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

Instead of executing identical Group By operations multiple times across sub-queries, the optimizer creates a single execution plan that serves as a template for all identical operations. This single copy of the computation logic is reused across all sub-queries that require the same aggregation, significantly reducing computational resource usage while maintaining complete data analysis capability

Inventive Principle:
Principle #26Copying

3Adaptability or versatility

If the DBMS executes queries with Union operators between sub-queries having identical Group By operations, then the query can process multiple data sources, but the execution time increases due to duplicative table accesses

Engineering Contradiction:
Improvemulti-source data processingVSAvoidquery execution time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The optimizer merges table access operations for sub-queries that share identical Group By clauses and algebraic functions. By consolidating these operations into a single table access followed by a unified Group By execution, the system processes multiple data sources efficiently without duplicative reads, reducing execution time while maintaining multi-source processing capability

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS8635206B2Database query optimization
Publication Date: 2014.01.21 AIRBNB INC
  • US8635206B2 patent drawing
  • US8635206B2 patent drawing
  • US8635206B2 patent drawing

AI summary

In some embodiments, a method includes detecting a structured query language (SQL) query. The method can also include determining that the SQL query includes a first sub-query and a second sub-query, wherein the first sub-query and second sub-query are operands for a Union operation, wherein a first result of the first sub-query is associated with a first Group By operation, wherein a second result of the second sub-query is associated with a second Group By operation, and wherein a result of the Union operation is associated with a third Group By operation. The method can also include determining that partitioning columns are the same for the first and second Group By operations; determining that the first and second sub-queries include identical algebraic functions; determining that the first Group By operation and first sub-query are not referenced elsewhere in the SQL query; and transforming the SQL query into an optimized query.