Name
Abstract | ||
|---|---|---|
We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of Functional Dependencies (FDs). Our focus is on the ability to list output tuples with a constant delay in between, following a linear-time preprocessing. A known dichotomy classifies the acyclic self-join-free CQs into those that admit such enumeration, and those that do not. However, this classification no longer holds in the common case where the database exhibits dependencies among attributes. That is, some queries that are classified as hard are in fact tractable if dependencies are accounted for. We establish a generalization of the dichotomy to accommodate FDs; hence, our classification determines which combination of a CQ and a set of FDs admits constant-delay enumeration with a linear-time preprocessing. In addition, we generalize a hardness result for cyclic CQs to accommodate unary FDs, and further conclusions of our development include a dichotomy for enumeration with linear delay. Finally, we show that all our results apply also for CQs with disequalities and in the presence of cardinality dependencies that generalize FDs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00224-019-09937-9 | Theory of Computing Systems |
Keywords | DocType | Volume |
Enumeration, Complexity, Conjunctive queries, Functional dependencies | Journal | 64 |
Issue | ISSN | Citations |
5 | 1432-4350 | 1 |
PageRank | References | Authors |
0.35 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nofar Carmeli | 1 | 6 | 4.84 |
| Markus Kröll | 2 | 3 | 1.39 |