59 search results - page 3 / 12 » Rewriting Unions of General Conjunctive Queries Using Views |
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...
ICDT
2005
ACM
14 years 29 days ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
We present MiniCount, the first efficient sound and complete algorithm for finding maximally contained rewritings of conjunctive queries with count, using conjunctive views with c...
SIGMOD
2006
ACM
14 years 7 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
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...