Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
We study the containment problem for conjunctive queries (CQs ) expanded with negated atoms or arithmetic comparisons. It is known that the problem is View the MathML source-complete [14] and [16]. The aim of this article is to find restrictions on CQs that allow for tractable containment. In parti...
Päätekijät: | Sherkhonov, E, Marx, M |
---|---|
Aineistotyyppi: | Journal article |
Julkaistu: |
Elsevier
2016
|
Samankaltaisia teoksia
-
Tractability beyond β-acyclicity for conjunctive queries with negation
Tekijä: Lanzinger, M
Julkaistu: (2021) -
The complexity of acyclic conjunctive queries
Tekijä: Gottlob, G, et al.
Julkaistu: (2001) -
The Complexity of Acyclic Conjunctive Queries
Tekijä: Gottlob, G, et al.
Julkaistu: (1998) -
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
Tekijä: Lanzinger, MP
Julkaistu: (2022) -
Optimization of Queries Containing Conjunctions of Conditions
Tekijä: S. D. Kuznetsov, et al.
Julkaistu: (2011-09-01)