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}
}
  • Phokion G. Kolaitis, Moshe Y. Vardi
  • Published 1998
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 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
    453 Citations
    The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
    • 9
    View-based query containment
    • 40
    • PDF
    Constraint satisfaction with infinite domains
    • 39
    • PDF
    Conjunctive query containment over trees using schema information
    • 3
    EFFICIENT APPROXIMATIONS OF CONJUNCTIVE
    • PDF
    Efficient approximations of conjunctive queries
    • 27
    • PDF
    Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
    • D. Marx
    • Mathematics, Computer Science
    • JACM
    • 2013
    • 93
    • PDF

    References

    Parametrized Complexity
    • Springer-Verlag
    • 1999