Enumeration on Trees with Tractable Combined Complexity and Efficient Updates

@article{Amarilli2019EnumerationOT,
  title={Enumeration on Trees with Tractable Combined Complexity and Efficient Updates},
  author={A. Amarilli and P. Bourhis and S. Mengel and M. Niewerth},
  journal={Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems},
  year={2019}
}
  • A. Amarilli, P. Bourhis, +1 author M. Niewerth
  • Published 2019
  • Computer Science
  • Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
  • 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 enumeration after logarithmic time in the tree. Further, all our combined complexities are polynomial in the automaton. Our result follows our previous circuit… CONTINUE READING
    11 Citations
    Constant-Delay Enumeration for Nondeterministic Document Spanners
    Constant-Delay Enumeration for Nondeterministic Document Spanners
    • 24
    • PDF
    Enumeration for FO Queries over Nowhere Dense Graphs
    • 19
    • PDF
    Constant delay enumeration for conjunctive queries
    • 2

    References

    SHOWING 1-7 OF 7 REFERENCES
    MSO queries on trees: enumerating answers under updates
    • 16
    • Highly Influential
    • PDF
    MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
    • G. Bagan
    • Mathematics, Computer Science
    • CSL
    • 2006
    • 72
    • Highly Influential
    Answering FO+MOD Queries under Updates on Bounded Degree Databases
    • 27
    • Highly Influential
    • PDF
    Enumeration of monadic second-order queries on trees
    • 35
    • Highly Influential
    • PDF
    Constant Delay Algorithms for Regular Document Spanners
    • 26
    • Highly Influential
    • PDF
    Marked ancestor problems
    • 71
    • Highly Influential
    Generalized finite automata theory with an application to a decision problem of second-order logic
    • 519
    • Highly Influential