Abstract
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other known algorithms in databases, and analyze it experimentally. Secondly, we present a new algorithm based on the translation of the containment problem into the problem of checking the unsatisfiability of a propositional logical formula, which allows us to use a SAT solver, and we experimentally compare both algorithms. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Mohamed, K. B., Leclère, M., & Mugnier, M. L. (2010). Containment of conjunctive queries with negation: Algorithms and experiments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6262 LNCS, pp. 330–345). https://doi.org/10.1007/978-3-642-15251-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
