Options
2007
Conference Paper
Titel
An efficient mechanism for matching multiple patterns with streamed XML data
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.