Boundedness of Conjunctive Regular Path Queries

    ICALP, 2019.

    Cited by: 0|Bibtex|Views13|Links
    EI

    Abstract:

    We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a coroll...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments