Journal article icon

Journal article

Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons

Abstract:
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 particular, we consider acyclic conjunctive queries. Even with the most restrictive form of acyclicity (Berge-acyclicity), containment is coNP-hard. But for a particular fragment of Berge-acyclic CQs with negated atoms or arithmetic comparisons —child-only tree patterns— containment is solvable in PTime.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.ipl.2016.12.005

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


Publisher:
Elsevier
Journal:
Information Processing Letters More from this journal
Volume:
120
Pages:
30-39
Publication date:
2016-12-23
Acceptance date:
2016-12-16
DOI:
EISSN:
1872-6119
ISSN:
0020-0190


Keywords:
Pubs id:
pubs:668737
UUID:
uuid:aeab0f9a-cc3d-468e-9756-15a93bd6048c
Local pid:
pubs:668737
Source identifiers:
668737
Deposit date:
2017-01-10

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP