Unordered tree matching and ordered tree matching: the evaluation of tree pattern queries

Author(s):  
Yangjun Chen ◽  
Leping Zou
2012 ◽  
Vol 9 (3) ◽  
pp. 1125-1153
Author(s):  
J. Travnícek ◽  
J. Janousek ◽  
B. Melichar

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.


2014 ◽  
Vol 43 (2) ◽  
pp. 473-495 ◽  
Author(s):  
Jian Liu ◽  
Z. M. Ma ◽  
Xue Feng
Keyword(s):  
Xml Data ◽  

2016 ◽  
Vol 17 (2) ◽  
pp. 1-34
Author(s):  
Michael Benedikt ◽  
Clemens Ley
Keyword(s):  

2008 ◽  
Vol 18 (1) ◽  
pp. 233-254 ◽  
Author(s):  
Dimitri Theodoratos ◽  
Pawel Placek ◽  
Theodore Dalamagas ◽  
Stefanos Souldatos ◽  
Timos Sellis
Keyword(s):  

2016 ◽  
Vol 41 (3) ◽  
pp. 1-43
Author(s):  
Filip Mazowiecki ◽  
Filip Murlak ◽  
Adam Witkowski
Keyword(s):  

2010 ◽  
Vol 13 (3) ◽  
pp. 343-371 ◽  
Author(s):  
Ki-Hoon Lee ◽  
Kyu-Young Whang ◽  
Wook-Shin Han
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document