Multi-Table Semi-Join Query Planning for Fact Table Reduction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Database management systems struggle to optimize queries involving a single fact table joined with multiple reducer tables due to limitations in applying semi-join reductions, leading to inefficient query execution.

Innovation Solution

Apply multiple applications of semi-join reduction to a common table using multiple reducers, creating table scan semi-joins as physical alternatives, and rearranging join orders to optimize the logical query plan, enabling efficient execution.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional join operations are used to join a fact table with multiple reducer tables, then the query can be executed, but the query execution efficiency deteriorates due to the large size of the fact table and multiple join operations

Engineering Contradiction:
Improvequery execution efficiencyVSAvoidsize of fact table
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent segments the join operation into multiple semi-join operations, where each semi-join reduces the fact table by filtering out rows that cannot match the current reducer table. This segmentation transforms a single large join into a sequence of smaller, more efficient operations that progressively reduce the data volume.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary filtering actions through semi-join operations before performing the final join. Each semi-join pre-processes the fact table by removing non-matching rows in advance, so that the subsequent join operations work with a already-reduced dataset, improving overall efficiency.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If semi-join reduction is applied to reduce the fact table size, then query performance improves, but the complexity of the query optimization process increases due to multiple applications of semi-join reduction

Engineering Contradiction:
Improvequery performanceVSAvoidcomplexity of query optimization process
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent implements a feedback mechanism in the query optimization process where the system evaluates whether to apply semi-join reduction at each join operation based on cost estimates. The optimizer receives feedback from cost calculations and adjusts its decisions accordingly, applying semi-join reduction only when it is determined to be beneficial, thus balancing performance improvement with optimization complexity.

Inventive Principle:
Principle #23Feedback

3Quantity of substance

If multiple semi-join reductions are applied to a fact table with multiple reducer tables, then the fact table size is significantly reduced, but the number of operations and computational overhead increases

Engineering Contradiction:
Improvesize of fact tableVSAvoidnumber of operations
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent changes the parameter of join operation type from traditional equi-join to semi-join, which fundamentally alters how the operations are performed. Semi-join operations change the computational approach by focusing on identifying matching keys first, then transferring only the necessary data, thereby reducing the effective workload despite increasing the operation count.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20260079939A1Multi-table scan semi-join database optimization
Publication Date: 2026.03.19 SAP SE
  • US20260079939A1 patent drawing
  • US20260079939A1 patent drawing
  • US20260079939A1 patent drawing

AI summary

In some embodiments, there is provided generating a logical query plan for a query that includes a single fact table and multiple reducer tables; optimizing the logical query plan for query execution; and executing the optimized logical query plan.