Simplifying XPath queries for optimization with regard to the elimination of intersect and except operators

  • Authors:

  • Sven Groppe;Jinghua Groppe;Stefan Böttcher

  • Affiliations:

  • University of Lübeck, Institute of Information Systems, D-23538 Lübeck, Germany;University of Lübeck, Institute of Information Systems, D-23538 Lübeck, Germany;University of Paderborn, Faculty 5, Fürstenallee 11, D-33102 Paderborn, Germany

  • Venue:
  • Data & Knowledge Engineering
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

XPath is widely used as an XML query language and is embedded in XQuery expressions and in XSLT stylesheets. In this paper which is an extended version of [Sven Groppe, Stefan Bottcher, Jinghua Groppe, XPath Query Simplification with regard to the elimination of intersect and except operators, in: 3rd International Workshop on XML Schema and Data Management (XSDM 2006) in conjuction with IEEE ICDE 2006, Atlanta, USA, 2006], 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. Additionally, we prove that XPath 1.0 is closed under complementation and first order complete.