loading...
XPath Query Simplification with regard to the Elimination of Intersect and Except Operators
Atlanta, Georgia April 03-April 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.16522nd International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sven Groppe, University of Innsbruck, Austria
Stefan B?ttcher, University of Paderborn, Germany
Jinghua Groppe, University of Innsbruck, Germany
XPath is widely used as an XML query language and is embedded in XQuery expressions and in XSLT stylesheets. In this paper, we propose a rule set which logically simplifies XPath queries by using a heuristic method in order to improve the processing time. Furthermore, we show how to substitute the XPath 2.0 intersect and except operators in a given XPath query with computed filter expressions. A performance evaluation comparing the execution times of the original XPath queries, which contain the intersect and except operators, and of the queries that are the result of our simplification approach shows that, depending on the used query evaluator and on the original query, performance improvements of a factor of up to 350 are possible.
Citation:
Sven Groppe, Stefan B?ttcher, Jinghua Groppe, "XPath Query Simplification with regard to the Elimination of Intersect and Except Operators," icdew, pp.86, 22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.