Semantic Acyclicity Under Constraints

    PODS, 2016.

    Cited by: 13|Bibtex|Views7|Links
    EI

    Abstract:

    A conjunctive query (CQ) is semantically acyclic if it is equivalent to an acyclic one. Semantic acyclicity has been studied in the constraint-free case, and deciding whether a query enjoys this property is NP-complete. However, in case the database is subject to constraints such as tuple-generating dependencies (tgds) that can express, e...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments