High-performance complex event processing over XML streams

@article{Mozafari2012HighperformanceCE,
  title={High-performance complex event processing over XML streams},
  author={Barzan Mozafari and Kai Zeng and Carlo Zaniolo},
  journal={Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data},
  year={2012}
}
Much research attention has been given to delivering high-performance systems that are capable of complex event processing (CEP) in a wide range of applications. However, many current CEP systems focus on processing efficiently data having a simple structure, and are otherwise limited in their ability to support efficiently complex continuous queries on structured or semi-structured information. However, XML streams represent a very popular form of data exchange, comprising large portions of… 

Figures from this paper

High-performance complex event processing over hierarchical data
TLDR
This article presents the XSeq language and system that support CEP on XML streams, via an extension of XPath that is both powerful and amenable to an efficient implementation, and illustrates its power for CEP applications through examples from different domains and provides formal results on its expressiveness and complexity.
Complex pattern matching in complex structures: The XSeq approach
TLDR
This demo will show examples of XSeq in different application domains, explain its compilation/query optimization techniques and show the speed-ups they deliver, and demonstrate how powerful and efficient application-specific languages were implemented by superimposing simple `skins' on XSequ and its system.
Method of Complex Event Processing over XML Streams
TLDR
Four optimization methods are proposed to improve performance by utilizing VPA and XML features: VPA-state reduction, VPA unification, delayed evaluation, and elimination of unnecessary XML processing.
Optimizing Expensive Queries in Complex Event Processing
TLDR
This study begins by analyzing the complexity of pattern queries, with a focus on the fundamental understanding of which features make pattern queries more expressive and at the same time more computationally expensive, and provides key insights for a series of optimizations to mitigate those bottlenecks.
On complexity and optimization of expensive queries in complex event processing
TLDR
This study begins by analyzing the complexity of pattern queries, with a focus on the fundamental understanding of which features make pattern queries more expressive and at the same time more computationally expensive, and provides key insights for a series of optimizations to mitigate those bottlenecks.
ASTRO: A Datalog System for Advanced Stream Reasoning
TLDR
This work elucidate the formal Streamlog semantics, which combined with the Pre-Mappability (PreM) concept, allows the declarative specification of many complex continuous queries, which are then efficiently executed in real-time by the portable ASTRO architecture.
Complex event processing over uncertain events: Techniques, challenges, and future directions
TLDR
The basics of uncertainty are discussed, models and query processing methods to deal with uncertainty are explored, and the future directions for handling uncertain events in CEP are discussed in detail.
A query language for semantic complex event processing: Syntax, semantics and implementation
TLDR
A new query language, called SPAseq, is proposed and implemented that extends SPARQL with new Semantic Complex Event Processing (SCEP) operators that can be evaluated over RDF graph-based events and an efficient implementation using a non-deterministic automata (NFA) model is provided.
Evaluation of XPath Queries on XML Streams with Networks of Early Nested Word Automata. (Évaluation de Requêtes XPath sur des Flux XML avec des Réseaux d'automates des mots imbriques)
TLDR
This thesis proposes to approximate earliest query answering for navigational XPath queries by compilation to early nested word automata, and develops streaming algorithms for the latter that outperform all previous approaches in time efficiency, coverage, and latency.
Early nested word automata for XPath query answering on XML streams
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Querying XML streams
TLDR
The TurboXPath path processor is proposed, which accepts a language equivalent to a subset of the for-let-where constructs of XQuery over a single document, and can be extended to provide full XQuery support or used to augment federated database engines for efficient handling of queries over XML data streams produced by external sources.
Path sharing and predicate evaluation for high-performance XML filtering
TLDR
The results show that the path sharing employed by YFilter can provide order-of-magnitude performance benefits, and two alternative techniques for extending YFilter's shared structure matching with support for value-based predicates are proposed, and the performance of these two techniques are compared.
High-performance complex event processing over streams
TLDR
This paper proposes a complex event language that significantly extends existing event languages to meet the needs of a range of RFID-enabled monitoring applications and describes a query plan-based approach to efficiently implementing this language.
From regular expressions to nested words
TLDR
The K*SQL language and system is designed, based on the investigation of the nested words, which are recent models that generalize both words and trees and provides novel optimization techniques for both sequence and XML queries.
Distributed event stream processing with non-deterministic finite automata
TLDR
An experimental evaluation of different methods for distributing an event processing system that is based on NFAs across multiple machines in a cluster shows that careful input stream partitioning gives close to linear performance scaleup for CPU bound workloads.
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
TLDR
The main features, key contributions, and lessons learned while implementing a purely relational XQuery system, which implements all essential XML database functionalities such that it can learn from the full consequences of the architectural decisions.
XMark: A Benchmark for XML Data Management
K*SQL: a unifying engine for sequence patterns and XML
TLDR
This demo presents the K*SQL system, a more expressive language that allows for generalized Kleene-closure queries and also achieves the expressive power of the nested word model, which greatly expands the application domain to include XML queries, software trace analysis, and genomics.
Visibly Pushdown Expression Effects for XML Stream Processing
TLDR
An effect system for a programming language that processes streams of tokens with parenthesis-like matching, as found in XML documents or s-expressions is defined, and the novel treatment of input provides a compositional description of the behaviour of programs with lookahead.
XPath queries on streaming data
We present the design and implementation of the XSQ system for querying streaming XML data using XPath 1.0. Using a clean design based on a hierarchical arrangement of pushdown transducers augmented
...
1
2
3
4
5
...