16 search results - page 2 / 4 » Finding Irredundant Contained Rewritings of Tree Pattern Que... |
EDBT
2002
ACM
14 years 5 months ago
2002
ACM
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...