Database Paper Browser

Back to papers

XPath Whole Query Optimization

Summary: Tree automata provide a general framework for fine-grained XML query optimization; defines relevant nodes as those touched by a minimal automaton to skip subtrees (and internal nodes with the right indexes). On-the-fly removal of alternation and nondeterminism in alternating automata, plus practical evaluation techniques without specialized indexes; experiments quantify gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10134
Venue
VLDB
Year
2010
Pagerank
4.1945683e-05
Overall Rank
12,281 | 14.57%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers