Optimal Regular Tree Pattern Matching Using Pushdown Automata

Trees are one of the fundamental data structures used in Computer Science. We present a new kind of acyclic pushdown automata, the tree pattern pushdown automaton and the nonlinear tree pattern pushdown automaton, constructed for an ordered tree. These automata accept all tree patterns and nonlinear tree patterns, respectively, which match the tree and represent a full index of the tree for such patterns. Given a tree with n nodes, the numbers of these distinct tree patterns and nonlinear tree patterns can be at most 2n?1 +n and at most (2+v)n?1+2, respectively, where v is the maximal number of nonlinear variables allowed in nonlinear tree patterns. The total sizes of nondeterministic versions of the two pushdown automata are O(n) and O(n2), respectively. We discuss the time complexities and show timings of our implementations using the bit-parallelism technique. The timings show that for a given tree the running time is linear to the size of the input pattern.

Download Full-text

On Tree Pattern Matching by Pushdown Automata

Acta Polytechnica ◽

10.14311/1113 ◽

2009 ◽

Vol 49 (2) ◽

Author(s):

T. Flouri

Keyword(s):

Programming Languages ◽

Pattern Matching ◽

Systematic Approach ◽

Term Rewriting ◽

Pushdown Automaton ◽

Tree Pattern ◽

Tree Pattern Matching ◽

String Pattern ◽

Pushdown Automata ◽

Mechanical Theorem

Tree pattern matching is an important operation in Computer Science on which a number of tasks such as mechanical theorem proving, term-rewriting, symbolic computation and non-procedural programming languages are based on. Work has begun on a systematic approach to the construction of tree pattern matchers by deterministic pushdown automata which read subject trees in prefix notation. The method is analogous to the construction of string pattern matchers: for given patterns, a non-deterministic pushdown automaton is created and then it is determinised. In this first paper, we present the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and prove its correctness.

Download Full-text

State Complexity of Regular Tree Languages for Tree Pattern Matching

Descriptional Complexity of Formal Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-09704-6_22 ◽

2014 ◽

pp. 246-257

Author(s):

Sang-Ki Ko ◽

Ha-Rim Lee ◽

Yo-Sub Han

Keyword(s):

Pattern Matching ◽

State Complexity ◽

Regular Tree ◽

Tree Pattern ◽

Tree Pattern Matching ◽

Tree Languages

Download Full-text

Parallel complex event detection based on regular tree pattern matching

Proceedings of 2018 International Conference on Big Data Technologies - ICBDT '18 ◽

10.1145/3226116.3226128 ◽

2018 ◽

Author(s):

Lei Yan ◽

Husheng Liao ◽

Hang Su

Keyword(s):

Pattern Matching ◽

Event Detection ◽

Regular Tree ◽

Tree Pattern ◽

Tree Pattern Matching

Download Full-text

TREE-BASED 2D INDEXING

International Journal of Foundations of Computer Science ◽

10.1142/s0129054111009100 ◽

2011 ◽

Vol 22 (08) ◽

pp. 1893-1907

Author(s):

JAN ŽĎÁREK ◽

BOŘIVOJ MELICHAR

Keyword(s):

Pattern Matching ◽

Tree Representation ◽

Text Indexing ◽

New Approach ◽

Tree Pattern ◽

2D Pattern ◽

Tree Pattern Matching ◽

Linear Text ◽

Pushdown Automata ◽

String Indexing

A new approach to the 2D pattern matching and specifically to 2D text indexing is proposed. A transformation of a 2D text into the form of a tree is presented. It preserves the context of each element of the 2D text. The tree can be linearised using the prefix notation into the form of a string (a linear text) and the pattern matching is performed in this text. Pushdown automata indexing the 2D text are constructed over the tree representation. They allow to search for 2D prefixes, 2D suffixes, and 2D factors of the 2D text in time proportional to the size of the representation of a 2D pattern. This result achieves the properties analogous to the results obtained in tree pattern matching and string indexing.

Download Full-text