Enumeration for MSO-Queries on Compressed Trees
Summary: Linear preprocessing and output-linear-delay enumeration for MSO queries on grammar-based compressed trees, with time measured in the size of the compressed grammar. Generalizes MSO enumeration on uncompressed trees and compressed-text spanners to tree grammars. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,339 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,507 | Path Queries on Compressed XML | 2003 | VLDB | 8.6311009e-05 |
| 3,563 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.9690833e-05 |
| 5,055 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 5.7312839e-05 |
| 8,752 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS | 4.456315e-05 |
Previous
Page 1 / 1
Next