The standard approach for optimization of XPath queries by rewriting queries using views techniques consists in navigating inside a view's output, thus allowing the usage of only one view in the rewritten query. Richer classes of rewritings, using intersection or joins on node identifiers, have been proposed, but they either lack completeness guarantees, or require additional information about the data. Our work is the first to characterize the problem of rewriting XPath queries using an intersection of views, by identifying the tightest restrictions under which the problem can be solved in polynomial time. As an additional contribution, we characterize the related problem of deciding whether an intersection of XPath expressions can be equivalently expressed as only one XPath.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, firstname.lastname@example.org.
[ Search ]