Semantic acyclicity on graph databases

    SIAM J. Comput., Volume 45, Issue 4, 2016, Pages 1339-1376.

    Cited by: 33|Bibtex|Views4|Links
    EI
    Keywords:
    evaluation problemsemantically acyclicarbitrary cqsconjunctive regular path queryequivalent acyclic uc2rpqMore(7+)

    Abstract:

    It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time, as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows from techniques in the area of constraint-satisfaction problems that "semantically acyclic" unions of CQs -- i.e., unions of CQs that are equivalent to a uni...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments