Monadic Datalog Containment on Trees

    AMW, 2014.

    Cited by: 5|Bibtex|Views1|Links
    EI

    Abstract:

    We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using the axes child and descendant, and when (b) considering ordered trees using the axes firstchild, nextsibling, child, and descendant. When omitting the descendan...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments