An efficient mechanism for matching multiple patterns with streamed XML data

Authors:
Andreas Hinnerichs;Edzard Höfig
Affiliations:
Fraunhofer FOKUS, Kaiserin-Augusta-Allee, Berlin, Germany;Fraunhofer FOKUS, Kaiserin-Augusta-Allee, Berlin, Germany
Venue:
SE'07 Proceedings of the 25th conference on IASTED International Multi-Conference: Software Engineering
Year:
2007

Citing 3
Cited 3

Processing XML Streams with Deterministic Automata

ICDT '03 Proceedings of the 9th International Conference on Database Theory
The XML web: a first study

WWW '03 Proceedings of the 12th international conference on World Wide Web
An efficient single-pass query evaluator for XML data streams

Proceedings of the 2004 ACM symposium on Applied computing

Intrinsic Monitoring Using Behaviour Models in IPv6 Networks

MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
Model-based integrated management: applying autonomic systems engineering to network and systems management

International Journal of Autonomous and Adaptive Communications Systems
On the performance of UML state machine interpretation at runtime

Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Filtering XML data streams using efficient pattern matching algorithms is a fundamental ability for many data-centric applications and main purpose of the Template Matching sPecification Language (TMPL). In this paper extensions to the language are discussed that enable fomulating more powerful query patterns: The declarative type system, improved predicates, template references and sequence matching operators. An optimised matching run-time based on lazy constructed automata is introduced together with an explanation of the underlying formalism. An Example, case studies and performance measurements illustrate the usage and usability of TMPL.