On the Enumeration Complexity of Unions of Conjunctive Queries
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019.
complexity constant delay enumeration unions of conjunctive queries
We study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between every successive tuples. It has been established that, in the absence of self joins and under conve...More
Full Text (Upload PDF)
Best Paper of PODS, 2019