Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Query automata over finite trees
Theoretical Computer Science
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
MTree: an XML XPath graph index
Proceedings of the 2006 ACM symposium on Applied computing
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient XPath query processing
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
XPathMark: an XPath benchmark for the XMark generated data
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Mixing bottom-up and top-down XPath query evaluation
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Optimized XPath evaluation for schema-compressed XML data
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
| Hi-index | 0.00 |
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization. We define the "relevant nodes" of a query as those nodes that a minimal automaton must touch in order to answer the query. This notion allows to skip many subtrees during execution, and, with the help of particular tree indexes, even allows to skip internal nodes of the tree. We efficiently approximate runs over relevant nodes by means of on-the-fly removal of alternation and non-determinism of (alternating) tree automata. We also introduce many implementation techniques which allows us to efficiently evaluate tree automata, even in the absence of special indexes. Through extensive experiments, we demonstrate the impact of the different optimization techniques.