License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.137
URN: urn:nbn:de:0030-drops-36697
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3669/
Brault-Baron, Johann
A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic
Abstract
It is known that the data complexity of a Conjunctive Query (CQ) is determined *only* by the way its variables are shared between atoms, reflected by its hypergraph. In particular, Yannakakis [Yannakakis VLDB'81,Beeri/Fagin/Maier/Yannakakis JACM'83] proved that a CQ is decidable in linear time when it is alpha-acyclic, i.e. its hypergraph is alpha-acyclic; Bagan et al. [Bagan/Durand/Grandjean CSL'07] even state:
* Any CQ is decidable in linear time iff it is alpha-acyclic. (under certain hypotheses)
(By linear time, we mean a query on a structure S can be decided in time O(|S|))
A natural question is: since the complexity of a *Negative* Conjunctive Query (NCQ), a conjunctive query where *all* atoms are negated, also only depends on its hypergraph, can we find a similar dichotomy in this case?
To answer this question, we revisit a result of Ordyniak et al. --- that states that satisfiability of a beta-acyclic CNF formula is decidable in polynomial time --- by proving that some part of their procedure can be done in linear time. This implies, under an algorithmic hypothesis that is likely true: (precisely: one cannot decide whether a graph is triangle-free in time O(n²log n) where n is the number of vertices.)
* Any NCQ is decidable in quasi-linear time iff it is beta-acyclic.
(By quasi-linear time, we mean a query on a structure S can be decided in time O(|S|log|S|))
We extend the easiness result to 'Signed' Conjunctive Query (SCQ) where 'some' atoms are negated. This has great interest since using some negated atoms is natural in the frameworks of databases and CSP. Furthermore, it implies straightforwardly the following:
* Any beta-acyclic existential first-order query is decidable in quasi-linear time.
BibTeX - Entry
@InProceedings{braultbaron:LIPIcs:2012:3669,
author = {Johann Brault-Baron},
title = {{A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic}},
booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
pages = {137--151},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-42-2},
ISSN = {1868-8969},
year = {2012},
volume = {16},
editor = {Patrick C{\'e}gielski and Arnaud Durand},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3669},
URN = {urn:nbn:de:0030-drops-36697},
doi = {10.4230/LIPIcs.CSL.2012.137},
annote = {Keywords: conjunctive query, hypergraph, beta-acyclicity, data complexity, Davis-Putnam procedure}
}
|
Keywords: |
|
conjunctive query, hypergraph, beta-acyclicity, data complexity, Davis-Putnam procedure |
|
Collection: |
|
Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL |
|
Issue Date: |
|
2012 |
|
Date of publication: |
|
03.09.2012 |
