Logical Queries in Distributed Stream Processing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current distributed stream processing systems lack the processing flexibility required for handling complex event streams, as existing solutions are inadequate for processing continuous data streams effectively, particularly in applications such as sensor data, financial tickers, and network performance monitoring.

Innovation Solution

The implementation of logical queries in a distributed stream processing system, where a logical query is converted into physical queries, and a directed acyclic graph is generated to optimize the execution of these queries, allowing for parallelism and efficient processing of event streams.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If multiple summaries based on different groups are executed in separate query stages, then each summary can be processed independently, but the system requires complex join functions to combine results and loses processing flexibility

Engineering Contradiction:
Improveprocessing flexibilityVSAvoidquery structure complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent merges multiple summaries based on different groups into a single query stage by introducing a unified group-by mechanism. Instead of executing separate query stages for each summary and then joining results, the system allows multiple group-by operations to coexist in one stage, eliminating the need for complex join functions and reducing overall query structure complexity while maintaining processing flexibility

Inventive Principle:
Principle #5Merging (Combining)

2Adaptability or versatility

If a single query stage processes multiple summaries, then processing flexibility improves, but the computational load in that stage increases significantly

Engineering Contradiction:
Improveprocessing flexibilityVSAvoidcomputational load
Core Design Contradiction:
Adaptability or versatilityVSPower

Solution Approach 1:

The patent segments the computational workload by introducing a two-phase processing model within a single query stage: first, multiple group-by operations are initiated in parallel on different data partitions; second, the results are efficiently merged using a coordinated aggregation mechanism. This segmentation distributes computational load across multiple processing units while maintaining the benefit of unified query stage processing

Inventive Principle:
Principle #1Segmentation

3Productivity

If traditional SQL queries are used on finite data sets, then queries produce static results, but they cannot handle continuous unbounded event streams effectively

Engineering Contradiction:
Improveevent stream processing capabilityVSAvoidquery mechanism adaptability
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent transforms static SQL query mechanisms into dynamic stream processing capabilities by introducing time-windowed group-by operations. Instead of processing finite data sets once, the system continuously applies group-by aggregations over sliding time windows on unbounded event streams, allowing queries to adapt dynamically to incoming data while maintaining SQL-like syntax and semantics

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS10877971B2Logical queries in a distributed stream processing system
Publication Date: 2020.12.29 ORACLE INT CORP
  • US10877971B2 patent drawing
  • US10877971B2 patent drawing
  • US10877971B2 patent drawing

AI summary

Techniques for implementing logical queries in a distributed stream processing system using automatic branching and joins. An exemplary technique includes determining a query is a logical query. The logical query includes two or more summaries based on different groups configured to execute in a single query stage of a stream analytics application. The technique further includes converting the logical query into one or more physical queries. The one or more physical queries are separated into individual query stages, and each of the query stages includes a summary from the two or more summaries that is based on an associated group. The technique further includes generating a directed acyclic graph for the one or more physical queries. The directed acyclic graph includes a physical query transformation for each of the individual query stages.