Query Execution Ordering via Minimum Spanning Tree
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Complex event processing systems face inefficiencies in executing multiple queries on real-time streaming data, particularly due to the need for optimizing query execution order to minimize computational cost.
Innovation Solution
A method is introduced to determine an efficient execution ordering for multiple pattern queries in a unified query plan using a query hierarchy and a directed graph, where the query hierarchy is mapped to a weighted directed graph, and a minimum spanning tree is used to identify the optimal execution order, reducing total execution cost.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple pattern queries are executed in a unified query plan without optimization, then query execution can proceed, but total execution cost increases and processing efficiency decreases
Solution Approach 1:
The system changes the execution order parameter of queries by mapping the query hierarchy to a weighted directed graph and computing a minimum spanning tree. This reordering optimizes the sequence in which queries are executed, reducing redundant computations and minimizing total execution cost while maintaining query processing functionality.
2Loss of energy
If queries are executed independently without considering execution order, then implementation is simpler, but total execution cost increases
Solution Approach 1:
The system introduces an intermediary optimization layer that sits between query submission and execution. This layer constructs a query hierarchy, maps it to a weighted directed graph, and computes a minimum spanning tree to determine optimal execution order. This intermediary process adds computational planning complexity but significantly reduces the total execution cost by eliminating redundant query processing.
Data Source
AI summary
There is provided a computer-implemented method of determining an execution ordering. An exemplary method comprises generating a directed graph based on a hierarchy. The hierarchy includes a plurality of pattern queries. The method also includes determining a minimum spanning tree of the directed graph. The method further includes determining an execution order of the pattern queries based on the minimum spanning tree.