• DOI:10.1145/3294052.3319702
Corpus ID: 56895341

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

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed