The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) (2006)
Atlanta, Georgia
Apr. 3, 2006 to Apr. 7, 2006
ISBN: 0-7695-2571-7
pp: 86
Sven Groppe , University of Innsbruck, Austria
Jinghua Groppe , University of Innsbruck, Germany
Stefan B?ttcher , University of Paderborn, 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.
Sven Groppe, Jinghua Groppe, Stefan B?ttcher, "XPath Query Simplification with regard to the Elimination of Intersect and Except Operators", 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), vol. 00, no. , pp. 86, 2006, doi:10.1109/ICDEW.2006.165
81 ms
(Ver 3.3 (11022016))