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} }
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
10 Citations
Constant-delay enumeration algorithms for document spanners over nested documents
- Computer Science
- ArXiv
- 2020
- PDF
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width
- Computer Science
- MFCS
- 2019
- 3
- PDF
Software Evolution in Time and Space: Unifying Version and Variability Management (Dagstuhl Seminar 19191)
- Computer Science
- Dagstuhl Reports
- 2019
- 7
- PDF
References
SHOWING 1-7 OF 7 REFERENCES
MSO queries on trees: enumerating answers under updates
- Computer Science, Mathematics
- CSL-LICS
- 2014
- 16
- Highly Influential
- PDF
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Mathematics, Computer Science
- CSL
- 2006
- 72
- Highly Influential
Answering FO+MOD Queries under Updates on Bounded Degree Databases
- Computer Science
- TODS
- 2018
- 27
- Highly Influential
- PDF
Enumeration of monadic second-order queries on trees
- Mathematics, Computer Science
- TOCL
- 2013
- 35
- Highly Influential
- PDF
Constant Delay Algorithms for Regular Document Spanners
- Computer Science
- PODS
- 2018
- 25
- Highly Influential
- PDF
Marked ancestor problems
- Mathematics, Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998
- 70
- Highly Influential
Generalized finite automata theory with an application to a decision problem of second-order logic
- Mathematics, Computer Science
- Mathematical systems theory
- 2005
- 517
- Highly Influential