Conjunctive-query containment and constraint satisfaction
@article{Kolaitis1998ConjunctivequeryCA, title={Conjunctive-query containment and constraint satisfaction}, author={Phokion G. Kolaitis and Moshe Y. Vardi}, journal={J. Comput. Syst. Sci.}, year={1998}, volume={61}, pages={302-332} }
Conjunctive-query containment is recognized as a fundamental problem in database query evaluation and optimization. At the same time, constraint satisfaction is recognized as a fundamental problem in artificial intelligence. What do conjunctive-query containment and constraint satisfaction have in common? Our main conceptual contribution in this paper is to point out that, despite their very different formulation, conjunctive-query containment and constraint satisfaction are essentially the… CONTINUE READING
Topics from this paper
453 Citations
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Mathematics, Computer Science
- SIAM J. Comput.
- 2017
- 9
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
- Computer Science
- SAT
- 2004
- 16
- PDF
Expanded acyclic queries: Containment and an application in explaining missing answers
- Computer Science
- 2016
- 44
- PDF
Conjunctive query containment over trees using schema information
- Mathematics, Computer Science
- Acta Informatica
- 2016
- 3
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
- Mathematics, Computer Science
- JACM
- 2013
- 93
- PDF
References
Parametrized Complexity
- Springer-Verlag
- 1999