Pruning nested XQuery queries

  • Authors:
  • Bilel Gueni;Talel Abdessalem;Bogdan Cautis;Emmanuel Waller

  • Affiliations:
  • LTCI-Telecom ParisTech, Paris, France;LTCI-Telecom ParisTech, Paris, France;LTCI-Telecom ParisTech, Paris, France;LRI-Université de Paris-Sud, Orsay, France

  • Venue:
  • Proceedings of the 17th ACM conference on Information and knowledge management
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present in this paper an approach for XQuery optimization that exploits minimization opportunities raised in composition-style nesting of queries. More precisely, we consider the simplification of XQuery queries in which the intermediate result constructed by a subexpression is queried by another subexpression. Based on a large subset of XQuery, we describe a rule-based algorithm that recursively prunes query expressions, eliminating useless intermediate results. Our algorithm takes as input an XQuery expression that may have navigation within its subexpressions and outputs a simplified, equivalent XQuery expression, and is thus readily usable as an optimization module in any existing XQuery processor. We demonstrate by experiments the impact of our rewriting approach on query evaluation costs and we prove formally its correctness.