126 search results - page 1 / 26 » The Complexity of Acyclic Conjunctive Queries |
127
Voted
FOCS
1998
IEEE
15 years 5 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...
64
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
95
Voted
ALT
2000
Springer
15 years 5 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...
76
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
222
Voted
ICDE
1996
IEEE
16 years 2 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...