Sciweavers

FOCS
1998
IEEE
14 years 3 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
ICDE
1996
IEEE
178views Database» more  ICDE 1996»
15 years 26 days ago
Query Folding
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...
Xiaolei Qian