126 search results - page 1 / 26 » The Complexity of Acyclic Conjunctive Queries |
FOCS
1998
IEEE
13 years 8 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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
ALT
2000
Springer
13 years 8 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
ICDE
1996
IEEE
14 years 5 months ago
1996
IEEE
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...