Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

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

    Cited by: 1|Bibtex|Views19|Links
    EI

    Abstract:

    We give an algorithm to enumerate the results on trees of monadic second-order (MSO) queries represented by nondeterministic tree automata. After linear time preprocessing (in the input tree), we can enumerate answers with linear delay (in each answer). We allow updates on the tree to take place at any time, and we can then restart the en...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments