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...
Κύριοι συγγραφείς: | Sherkhonov, E, Marx, M |
---|---|
Μορφή: | Journal article |
Έκδοση: |
Elsevier
2016
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Tractability beyond β-acyclicity for conjunctive queries with negation
ανά: Lanzinger, M
Έκδοση: (2021) -
The complexity of acyclic conjunctive queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (2001) -
The Complexity of Acyclic Conjunctive Queries
ανά: Gottlob, G, κ.ά.
Έκδοση: (1998) -
Tractability beyond β-acyclicity for conjunctive queries with negation and SAT
ανά: Lanzinger, MP
Έκδοση: (2022) -
Optimization of Queries Containing Conjunctions of Conditions
ανά: S. D. Kuznetsov, κ.ά.
Έκδοση: (2011-09-01)