XPath Whole Query Optimization

Details XPath Whole Query Optimization XPath Whole Query Optimization

2010-03-23

arxiv.org/abs/1003.4353v2

Computer Science

Databases

12 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

XPath Whole Query Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with XPath Whole Query Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and XPath Whole Query Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211105