Talks and Poster Presentations (with Proceedings-Entry):

M. Kröll, N. Carmeli:
"Enumeration Complexity of Conjunctive Queries with Functional Dependencies";
Talk: Edbt / Icdt 2018, Wien; 2018-03-26 - 2018-03-29; in: "21st International Conference on Database Theory, {ICDT} 2018", LIPIcs, 11 (2018), ISBN: 978-3-89318-078-3; 1 - 17.

English 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 a common type of FDs. Further conclusions of our development include a dichotomy for enumeration with linear delay, and a dichotomy for CQs with disequalities. Finally, we show that all our results apply to the known class of "cardinality dependencies" that generalize FDs (e.g., by stating an upper bound on the number of genres per movies, or friends per person).

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Related Projects:
Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen

Project Head Reinhard Pichler:
Heterogene Information Integration

Created from the Publication Database of the Vienna University of Technology.