Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Using Regular Tree Automata as XML Schemas
ADL '00 Proceedings of the IEEE Advances in Digital Libraries 2000
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
BLAS: an efficient XPath processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query translation from XPATH to SQL in the presence of recursive DTDs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On the minimization of Xpath queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Optimizing XPath expressions before query execution is an important measure for efficient improvement of the holistic performance. After path summary is derived from a XML document, we equivalently transfer a path expression into the ones without descendent axes or wildcards. To rewrite a linear path expression, its analytical path set is calculated in polynomial time under path summary. For complex expressions, we disclose path restraints among nodes in its tree pattern under path summary, and develop a rewriting algorithm to completely eliminate its descendent and wildcard features. Thereof, path summary provides an excellent basis for rewriting XPath expressions. The experimental results show that our algorithm can rewrite XPath expressions effectively.