66 search results - page 2 / 14 » Conjunctive Query Containment over Trees |
PODS
2004
ACM
14 years 5 months ago
2004
ACM
PODS
2004
ACM
14 years 5 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
PODS
2000
ACM
13 years 10 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
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...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...