The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The complexity of acyclic conjunctive queries revisited
[article]
2006
arXiv
pre-print
In this paper, we consider first-order logic over unary functions and study the complexity of the evaluation problem for conjunctive queries described by such kind of formulas. A natural notion of query acyclicity for this language is introduced and we study the complexity of a large number of variants or generalizations of acyclic query problems in that context (Boolean or not Boolean, with or without inequalities, comparisons, etc...). Our main results show that all those problems are
arXiv:cs/0605008v1
fatcat:jkbyspg7rfeqhdjiydb5zkqkye