Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Enumeration for MSO-Queries on Compressed Trees (2403.03067v1)

Published 5 Mar 2024 in cs.FL and cs.DB

Abstract: We present a linear preprocessing and output-linear delay enumeration algorithm for MSO-queries over trees that are compressed in the well-established grammar-based framework. Time bounds are measured with respect to the size of the compressed representation of the tree. Our result extends previous work on the enumeration of MSO-queries over uncompressed trees and on the enumeration of document spanners over compressed text documents.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Enumeration on trees with tractable combined complexity and efficient updates. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2019, pages 89–103. ACM, 2019.
  2. Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, volume 4207 of Lecture Notes in Computer Science, pages 167–181. Springer, 2006.
  3. Guillaume Bagan. Algorithmes et complexité des problèmes d’énumération pour l’évaluation de requêtes logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). PhD thesis, University of Caen Normandy, France, 2009.
  4. The smallest grammar problem revisited. IEEE Trans. Inf. Theory, 67(1):317–328, 2021.
  5. Tree compression with top trees. Information and Computation, 243:166–177, 2015.
  6. Forest algebras. In Proceedings of Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., volume 2 of Texts in Logic and Games, pages 107–132. Amsterdam University Press, 2008.
  7. Clux - clustering XML sub-trees. In ICEIS 2010 - Proceedings of the 12th International Conference on Enterprise Information Systems, Volume 1, DISI, Funchal, Madeira, Portugal, June 8 - 12, 2010, pages 142–150, 2010.
  8. XML compression via directed acyclic graphs. Theory of Computing Systems, 57(4):1322–1371, 2015.
  9. Path queries on compressed XML. In Proceedings of 29th International Conference on Very Large Data Bases, VLDB 2003, Berlin, Germany, September 9-12, 2003, pages 141–152, 2003.
  10. Efficient memory representation of XML document trees. Inf. Syst., 33(4-5):456–474, 2008.
  11. Querying unranked trees with stepwise tree automata. In Vincent van Oostrom, editor, Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings, volume 3091 of Lecture Notes in Computer Science, pages 105–118. Springer, 2004.
  12. On the complexity of the smallest grammar problem over fixed alphabets. Theory Comput. Syst., 65(2):344–409, 2021.
  13. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554–2576, 2005.
  14. Bruno Courcelle. Linear delay enumeration and monadic second-order logic. Discrete Applied Mathematics, 157(12):2675–2700, 2009.
  15. Slowing down top trees for better worst-case compression. In Proceedings of the Annual Symposium on Combinatorial Pattern Matching, CPM 2018, volume 105 of LIPIcs, pages 16:1–16:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
  16. Query evaluation on compressed trees (extended abstract). In 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 22-25 June 2003, Ottawa, Canada, Proceedings, page 188. IEEE Computer Society, 2003.
  17. Moses Ganardi. Compression by Contracting Straight-Line Programs. In Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021), volume 204 of LIPIcs, pages 45:1–45:16. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021.
  18. Pattern matching on grammar-compressed strings in linear time. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 2833–2846, 2022.
  19. Constructing small tree grammars and small circuits for formulas. Journal of Computer and System Sciences, 86:136–158, 2017.
  20. Balancing straight-line programs. Journal of the ACM, 68(4):27:1–27:40, 2021.
  21. Grammar-based compression of unranked trees. Theory of Computing Systems, 64(1):141–176, 2020.
  22. Real-time traversal in grammar-based compressed files. In Proceedings to the 2005 Data Compression Conference, DCC 2005, page 458. IEEE Computer Society, 2005.
  23. LZ77 Factorisation of Trees. In Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, volume 65 of LIPIcs, pages 35:1–35:15. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2016.
  24. Tree compression with top trees revisited. In Proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, volume 9125 of Lecture Notes in Computer Science, pages 15–27. Springer, 2015.
  25. Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log., 14(4):25:1–25:12, 2013.
  26. MSO queries on trees: Enumerating answers under updates using forest algebras. CoRR, abs/2208.04180, 2022.
  27. Ming Li and Paul M. B. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Texts in Computer Science. Springer, 2008.
  28. Markus Lohrey. Algorithmics on SLP-compressed strings: A survey. Groups Complexity Cryptology, 4(2):241–299, 2012.
  29. Markus Lohrey. Grammar-based tree compression. In Proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, volume 9168 of Lecture Notes in Computer Science, pages 46–57. Springer, 2015.
  30. XML tree structure compression using repair. Information Systems, 38(8):1150–1167, 2013.
  31. Compression of unordered XML trees. In Proceedings of the 20th International Conference on Database Theory, ICDT 2017, volume 68 of LIPIcs, pages 18:1–18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
  32. Constant-time tree traversal and subtree equality check for grammar-compressed trees. Algorithmica, 80(7):2082–2105, 2018.
  33. Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci., 78(5):1651–1669, 2012.
  34. Constant-delay enumeration for SLP-compressed documents. In Proceedings of the 26th International Conference on Database Theory, ICDT 2023, volume 255 of LIPIcs, pages 7:1–7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  35. Matthias Niewerth. MSO queries on trees: Enumerating answers under updates using forest algebras. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pages 769–778, 2018.
  36. W. Rytter. Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science, 302(1–3):211–222, 2003.
  37. Spanner evaluation over slp-compressed documents. In PODS’21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021, pages 153–165, 2021.
  38. Query evaluation over SLP-represented document databases with complex document editing. In Proceedings of 41st Symposium on Principles of Database Systems, PODS 2022, pages 79–89. ACM, 2022.
  39. A succinct grammar compression. In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013, volume 7922 of Lecture Notes in Computer Science, pages 235–246. Springer, 2013.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now