On the Enumeration Complexity of Unions of Conjunctive Queries

    Nofar Carmeli
    Nofar Carmeli
    Markus Kröll
    Markus Kröll

    Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019.

    Cited by: 0|Bibtex|Views13|Links
    EI
    Keywords:
    complexity constant delay enumeration unions of conjunctive queries

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Best Paper
    Best Paper of PODS, 2019
    Tags
    Comments