Data Management

Efficient Rewriting of XPath Queries Using Query Set Specifications

Free registration required

Executive Summary

The authors study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such families of queries they adopt the Query Set Specifications, formalism close to context-free grammars. They say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions.

  • Format: PDF
  • Size: 245.1 KB