106 search results - page 5 / 22 » On rewriting XPath queries using views |
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
WAIM
2009
Springer
14 years 2 months ago
2009
Springer
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...