XML Query Template for High-Rate Event Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current event processing systems using SQL queries face challenges in handling high-rate event processing due to the limitations of relational algebra and require specific data sources, making them unsuitable for use with different data sources.
Innovation Solution
An event processing framework that utilizes reusable XML query templates, allowing a single template to be instantiated and bound to various input and output adapters, enabling the same query to be executed across multiple event sources and sinks, with operators including relational algebra, time-based, and other types, facilitating conversion between proprietary data formats.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If SQL queries are used to analyze events, then event processing can be performed, but the processing rate is limited due to the limitations of relational algebra
Solution Approach 1:
The patent changes the fundamental parameters of the query language from relational algebra (SQL) to a stream-processing oriented language (SPARQL) that is specifically designed for handling event streams. This parameter change enables the system to process events at high rates by using operators that are naturally suited for sequential stream processing rather than relational operations.
Solution Approach 2:
The patent replaces the mechanical relational algebra system with a different operational mechanism - a graph-based stream processing model where events flow through a directed graph of operators. This substitution allows for more efficient event processing by eliminating the need for complex relational joins and aggregations that bottleneck traditional SQL systems.
2Productivity
If SQL queries are used, then event analysis can be performed, but time-based calculations become difficult
Solution Approach 1:
The patent introduces dynamic time-based operators that can adapt to different time windows and temporal patterns. The query language includes operators for sliding windows, rolling averages, and time-based filtering that dynamically adjust to the event stream's temporal characteristics, making time-based calculations straightforward and flexible.
3Adaptability or versatility
If SQL queries recite specific data sources, then the query can be executed, but the query becomes unsuitable for use with different data sources
Solution Approach 1:
The patent creates a universal query language and framework that can execute the same query against multiple different data sources and event streams. The graph-based operator model and standardized interfaces allow a single query template to be instantiated and bound to different input adapters and output adapters, enabling one query to serve multiple purposes across different systems.
Solution Approach 2:
The patent segments the query into reusable operator components that can be independently bound to different data sources. By breaking down the query into modular operators (filter, join, aggregate, output) that can be dynamically instantiated with different data source adapters, the system achieves high reusability without sacrificing execution specificity.
Data Source
AI summary
Methods, systems, and computer-readable media are disclosed for event processing with a query based on a reusable XML query template. A particular method includes receiving a plurality of events from a source and generating a plurality of event objects based on the plurality of events. A query represented by an XML file based on a reusable XML query template is executed with respect to the plurality of event objects to produce a plurality of result objects. Each result object is produced based on an application of at least one operator of the query. A plurality of results is generated based on the plurality of result objects, and the plurality of results is transmitted to a sink.


