Sciweavers

FOCS
1998
IEEE
13 years 8 months ago
The Complexity of Acyclic Conjunctive Queries
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...
Georg Gottlob, Nicola Leone, Francesco Scarcello
EDBT
2002
ACM
136views Database» more  EDBT 2002»
14 years 3 months ago
Rewriting Unions of General Conjunctive Queries Using Views
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...
Junhu Wang, Michael J. Maher, Rodney W. Topor