Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
Summary: Enumerates MSO query answers on trees represented by nondeterministic tree automata with linear preprocessing and linear per-answer delay (constant-delay for MSO with only free FO variables), combined complexity polynomial in the automaton. Supports leaf insert/delete/relabel updates that restart enumeration in logarithmic time, with update time optimal up to doubly-logarithmic factors. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Antoine Amarilli
- 2. Pierre Bourhis
- 3. Stefan Mengel
- 4. Matthias Niewerth
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,695 | CORE: a Complex Event Recognition Engine | 2022 | VLDB | 4.6757592e-05 |
| 8,738 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 4.456315e-05 |
| 8,754 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 4.456315e-05 |
| 9,653 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS | 4.3109001e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 772 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.00016876498 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,167 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS | 5.1717635e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |
| 2,855 | Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach | 2003 | VLDB | 8.0059865e-05 |
| 7,501 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS | 4.7180617e-05 |
| 8,754 | Efficient Enumeration for Annotated Grammars | 2022 | PODS | 4.456315e-05 |
| 5,296 | Running Tree Automata on Probabilistic XML | 2009 | PODS | 5.5802694e-05 |
| 13,585 | Monadic Datalog over Finite Structures with Bounded Treewidth | 2007 | PODS | - |
| 5,870 | Query Automata (extended abstract) | 1999 | PODS | 5.2943906e-05 |
| 2,293 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS | 9.0899933e-05 |
| 8,738 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 4.456315e-05 |