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
- 1. Markus Lohrey (University of Siegen)
- 2. Markus L. Schmid (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{lohrey_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{Enumeration for MSO-Queries on Compressed Trees}},
url = {https://dl.acm.org/doi/10.1145/3651141},
doi = {10.1145/3651141},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Lohrey, Markus and Schmid, Markus L.},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,080 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 4.9793485e-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,525 | Path Queries on Compressed XML | 2003 | VLDB | 8.343313e-05 |
| 4,789 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.413875e-05 |
| 5,708 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 6.0254441e-05 |
| 9,083 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS | 5.2283159e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,091 | Ranked Enumeration of Minimal Triangulations | 2019 | PODS |
| 2 | 4,405 | Efficient Document Analytics on Compressed Data: Method, Challenges, Algorithms, Insights | 2018 | VLDB |
| 3 | 2,591 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 4 | 2,525 | Path Queries on Compressed XML | 2003 | VLDB |
| 5 | 4,189 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS |
| 6 | 9,786 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD |
| 7 | 5,164 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 8 | 4,789 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS |
| 9 | 4,186 | Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates | 2018 | PODS |
| 10 | 5,708 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |