16 search results - page 1 / 4 » Finding Irredundant Contained Rewritings of Tree Pattern Que... |
WAIM
2009
Springer
13 years 11 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...
WISE
2007
Springer
13 years 11 months ago
2007
Springer
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
VLDB
2007
ACM
14 years 4 months ago
2007
ACM
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
ICDT
2005
ACM
13 years 10 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...
AMW
2009
13 years 5 months ago
2009
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...