Document Open Access Logo

FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree

Authors Markus Lohrey , Sebastian Maneth , Markus L. Schmid

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.MFCS.2025.69.pdf
  • Filesize: 0.85 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.MFCS.2025.69.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Database query processing and optimization (theory)
  • Theory of computation → Logic and databases
Keywords
  • Enumeration algorithms
  • FO-logic
  • query evaluation over compressed data

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Enumerating the result set of a first-order query over a relational structure of bounded degree can be done with linear preprocessing and constant delay. In this work, we extend this result towards the compressed perspective where the structure is given in a potentially highly compressed form by a straight-line program (SLP). Our main result is an algorithm that enumerates the result set of a first-order query over a structure of bounded degree that is represented by an SLP satisfying the so-called apex condition. For a fixed formula, the enumeration algorithm has constant delay and needs a preprocessing time that is linear in the size of the SLP.

Cite As Get BibTex

Markus Lohrey, Sebastian Maneth, and Markus L. Schmid. FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 69:1-69:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.MFCS.2025.69

Author Details

Markus Lohrey
  • University of Siegen, Germany
Sebastian Maneth
  • University of Bremen, Germany
Markus L. Schmid
  • Humboldt-Universität zu Berlin, Germany

Funding

  • Schmid, Markus L.: Supported by the German Research Foundation (Deutsche Forschungsgemeinschaft, DFG) – project number 522576760 (gefördert durch die Deutsche Forschungsgemeinschaft (DFG) – Projektnummer 522576760).

References

  1. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, and Mihalis Yannakakis. Analysis of recursive state machines. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(4):86-818, 2005. URL: https://doi.org/10.1145/1075382.1075387.
  2. Rajeev Alur and Mihalis Yannakakis. Model checking of hierarchical state machines. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(3):273-303, 2001. URL: https://doi.org/10.1145/503502.503503.
  3. Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In Proceedings of the 20th International Workshop on Computer Science Logic, CSL 2006, volume 4207 of Lecture Notes in Computer Science, pages 167-181. Springer, 2006. URL: https://doi.org/10.1007/11874683_11.
  4. Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On acyclic conjunctive queries and constant delay enumeration. In Proceedings of the 21st International Workshop on Computer Science Logic, CSL 2007, volume 4646 of Lecture Notes in Computer Science, pages 208-222. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-74915-8_18.
  5. Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jeż, Markus Lohrey, and Carl Philipp Reh. The smallest grammar problem revisited. IEEE Transaction on Information Theory, 67(1):317-328, 2021. URL: https://doi.org/10.1109/TIT.2020.3038147.
  6. Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Mathematical System Theory, 20(2-3):83-127, 1987. URL: https://doi.org/10.1007/BF01692060.
  7. Christoph Berkholz, Fabian Gerhardt, and Nicole Schweikardt. Constant delay enumeration for conjunctive queries: a tutorial. ACM SIGLOG News, 7(1):4-33, 2020. URL: https://doi.org/10.1145/3385634.3385636.
  8. Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering FO+MOD queries under updates on bounded degree databases. ACM Transactions on Database Systems, 43(2):7:1-7:32, 2018. URL: https://doi.org/10.1145/3232056.
  9. Romain Brenguier, Stefan Göller, and Ocan Sankur. A comparison of succinctly represented finite-state systems. In Proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, volume 7454 of Lecture Notes in Computer Science, pages 147-161. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-32940-1_12.
  10. Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid. On the complexity of the smallest grammar problem over fixed alphabets. Theory of Computing Systems, 65(2):344-409, 2021. URL: https://doi.org/10.1007/s00224-020-10013-w.
  11. Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, and Abhi Shelat. The smallest grammar problem. IEEE Transactions on Information Theory, 51(7):2554-2576, 2005. URL: https://doi.org/10.1109/TIT.2005.850116.
  12. Bruno Courcelle and Joost Engelfriet. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2012. URL: https://doi.org/10.1017/CBO9780511977619.
  13. Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logic, 8(4):21, 2007. URL: https://doi.org/10.1145/1276920.1276923.
  14. Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. Enumerating answers to first-order queries over databases of low degree. Logical Methods in Computer Science, 18(2), 2022. URL: https://doi.org/10.46298/LMCS-18(2:7)2022.
  15. Heinz-Dieter Ebbinghaus and Jörg Flum. Finite model theory. Perspectives in Mathematical Logic. Springer, 1995. URL: https://doi.org/10.1007/3-540-28788-4.
  16. Joost Engelfriet. Context-free graph grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, Volume 3: Beyond Words, pages 125-213. Springer, 1997. URL: https://doi.org/10.1007/978-3-642-59126-6_3.
  17. Joost Engelfriet, Linda Heyker, and George Leih. Context-free graph languages of bounded degree are generated by apex graph grammars. Acta Informatica, 31(4):341-378, 1994. URL: https://doi.org/10.1007/BF01178511.
  18. Joost Engelfriet and Grzegorz Rozenberg. A comparison of boundary graph grammars and context-free hypergraph grammars. Information and Computation, 84(2):163-206, 1990. URL: https://doi.org/10.1016/0890-5401(90)90038-J.
  19. Rachel Faran and Orna Kupferman. LTL with arithmetic and its applications in reasoning about hierarchical systems. In LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 57 of EPiC Series in Computing, pages 343-362. EasyChair, 2018. URL: https://doi.org/10.29007/WPG3.
  20. Rachel Faran and Orna Kupferman. A parametrized analysis of algorithms on hierarchical graphs. International Journal on Foundations of Computer Science, 30(6-7):979-1003, 2019. URL: https://doi.org/10.1142/S0129054119400252.
  21. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2006. URL: https://doi.org/10.1007/3-540-29953-X.
  22. Moses Ganardi and Pawel Gawrychowski. Pattern matching on grammar-compressed strings in linear time. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, pages 2833-2846. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.110.
  23. Moses Ganardi, Artur Jeż, and Markus Lohrey. Balancing straight-line programs. Journal of the ACM, 68(4):27:1-27:40, 2021. URL: https://doi.org/10.1145/3457389.
  24. Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, and Kurt Sieber. Grammar-based compression of unranked trees. Theory of Computing Systems, 64(1):141-176, 2020. URL: https://doi.org/10.1007/s00224-019-09942-y.
  25. Ferenc Gécseg and Magnus Steinby. Tree languages. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, Volume 3: Beyond Words, pages 1-68. Springer, 1997. URL: https://doi.org/10.1007/978-3-642-59126-6_1.
  26. Stefan Göller and Markus Lohrey. Fixpoint logics on hierarchical structures. Theory of Computing Systems, 48(1):93-131, 2009. URL: https://doi.org/10.1007/s00224-009-9227-1.
  27. Annegret Habel and Hans-Jörg Kreowski. Some structural aspects of hypergraph languages generated by hyperedge replacement. In Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1987, volume 247 of Lecture Notes in Computer Science, pages 207-219. Springer, 1987. URL: https://doi.org/10.1007/BFB0039608.
  28. Wojciech Kazana and Luc Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science, 7(2), 2011. URL: https://doi.org/10.2168/LMCS-7(2:20)2011.
  29. Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. In Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, pages 297-308. ACM, 2013. URL: https://doi.org/10.1145/2463664.2463667.
  30. Wojciech Kazana and Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic, 14(4):25:1-25:12, 2013. URL: https://doi.org/10.1145/2528928.
  31. Benny Kimelfeld, Wim Martens, and Matthias Niewerth. A formal language perspective on factorized representations. In Proceedings of the 28th International Conference on Database Theory, ICDT 2025, volume 328 of LIPIcs, pages 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPICS.ICDT.2025.20.
  32. Stephan Kreutzer and Anuj Dawar. Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity, TR09-131, 2009. URL: https://eccc.weizmann.ac.il/report/2009/131.
  33. N. Jesper Larsson and Alistair Moffat. Off-line dictionary-based compression. Proceedings of the IEEE, 88(11):1722-1732, 2000. URL: https://doi.org/10.1109/5.892708.
  34. Thomas Lengauer. Hierarchical planarity testing algorithms. Journal of the ACM, 36(3):474-509, 1989. URL: https://doi.org/10.1145/65950.65952.
  35. Thomas Lengauer and Klaus W. Wagner. The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Journal of Computer and System Sciences, 44:63-93, 1992. URL: https://doi.org/10.1016/0022-0000(92)90004-3.
  36. Thomas Lengauer and Egon Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM Journal on Computing, 17(6):1063-1080, 1988. URL: https://doi.org/10.1137/0217068.
  37. Leonid Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004. URL: https://doi.org/10.1007/978-3-662-07003-1.
  38. Markus Lohrey. Algorithmics on SLP-compressed strings: A survey. Groups Complexity Cryptology, 4(2):241-299, 2012. URL: https://doi.org/10.1515/gcc-2012-0016.
  39. Markus Lohrey. Model-checking hierarchical structures. Journal of Computer and System Sciences, 78(2):461-490, 2012. URL: https://doi.org/10.1016/J.JCSS.2011.05.006.
  40. 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. URL: https://doi.org/10.1007/978-3-319-21500-6_3.
  41. Markus Lohrey, Sebastian Maneth, and Roy Mennicke. XML tree structure compression using RePair. Information Systems, 38(8):1150-1167, 2013. URL: https://doi.org/10.1016/J.IS.2013.06.006.
  42. Markus Lohrey, Sebastian Maneth, and Carl Philipp Reh. Constant-time tree traversal and subtree equality check for grammar-compressed trees. Algorithmica, 80(7):2082-2105, 2018. URL: https://doi.org/10.1007/s00453-017-0331-3.
  43. Markus Lohrey, Sebastian Maneth, and Markus L. Schmid. FO-query enumeration over SLP-compressed structures of bounded degree, 2025. URL: https://arxiv.org/abs/2506.19421.
  44. Markus Lohrey, Sebastian Maneth, and Manfred Schmidt-Schauß. Parameter reduction and automata evaluation for grammar-compressed trees. Journal of Computer and System Sciences, 78(5):1651-1669, 2012. URL: https://doi.org/10.1016/j.jcss.2012.03.003.
  45. Markus Lohrey and Markus L. Schmid. Enumeration for MSO-queries on compressed trees. Proceedings of the ACM on Management of Data, 2(2):78, 2024. URL: https://doi.org/10.1145/3651141.
  46. Sebastian Maneth and Fabian Peternek. Grammar-based graph compression. Information Systems, 76:19-45, 2018. URL: https://doi.org/10.1016/J.IS.2018.03.002.
  47. Sebastian Maneth and Fabian Peternek. Constant delay traversal of grammar-compressed graphs with bounded rank. Information and Computation, 273:104520, 2020. URL: https://doi.org/10.1016/J.IC.2020.104520.
  48. Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, and Venkatesh Radhakrishnan. Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM Journal on Computing, 27(5):1237-1261, 1998. URL: https://doi.org/10.1137/S0097539795285254.
  49. Madhav V. Marathe, Harry B. Hunt III, and S. S. Ravi. The complexity of approximation PSPACE-complete problems for hierarchical specifications. Nordic Journal of Computing, 1(3):275-316, 1994. URL: https://www.cs.helsinki.fi/njc/njc1_papers/number3/paper1.pdf.
  50. Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, and S. S. Ravi. Hierarchically specified unit disk graphs. Theoretical Computer Science, 174(1-2):23-65, 1997. URL: https://doi.org/10.1016/S0304-3975(96)00008-4.
  51. Martin Muñoz and Cristian Riveros. Constant-delay enumeration for SLP-compressed documents. Logical Methods in Computer Science, 21(1), 2025. URL: https://doi.org/10.46298/LMCS-21(1:17)2025.
  52. Craig G. Nevill-Manning and Ian H. Witten. Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research, 7:67-82, 1997. URL: https://doi.org/10.1613/JAIR.374.
  53. Dan Olteanu. Factorized databases: A knowledge compilation perspective. In Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016, 2016. URL: http://www.aaai.org/ocs/index.php/WS/AAAIW16/paper/view/12638.
  54. Dan Olteanu and Maximilian Schleich. F: regression models over factorized views. Proceedings of the VLDB Endowment, 9(13):1573-1576, 2016. URL: https://doi.org/10.14778/3007263.3007312.
  55. Dan Olteanu and Maximilian Schleich. Factorized databases. ACM SIGMOD Record, 45(2):5-16, 2016. URL: https://doi.org/10.1145/3003665.3003667.
  56. Dan Olteanu and Jakub Závodný. Size bounds for factorised representations of query results. ACM Transactions on Database Systems, 40(1):2:1-2:44, 2015. URL: https://doi.org/10.1145/2656335.
  57. Leonid Peshkin. Structure induction by lossless graph compression. In Proceedings of the 2007 Data Compression Conference, DCC 2007, pages 53-62. IEEE Computer Society, 2007. URL: https://doi.org/10.1109/DCC.2007.73.
  58. William C. Rounds. Mappings and grammars on trees. Mathematical System Theory, 4(3):257-287, 1970. URL: https://doi.org/10.1007/BF01695769.
  59. Markus L. Schmid and Nicole Schweikardt. Spanner evaluation over SLP-compressed documents. In Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2021, pages 153-165. ACM, 2021. URL: https://doi.org/10.1145/3452021.3458325.
  60. Markus L. Schmid and Nicole Schweikardt. Query evaluation over SLP-represented document databases with complex document editing. In Proceedings of the International Conference on Management of Data, PODS 2022, pages 79-89. ACM, 2022. URL: https://doi.org/10.1145/3517804.3524158.
  61. Nicole Schweikardt, Luc Segoufin, and Alexandre Vigny. Enumeration for FO queries over nowhere dense graphs. Journal of the ACM, 69(3):22:1-22:37, 2022. URL: https://doi.org/10.1145/3517035.
  62. Detlef Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6(6):505-526, 1996. URL: https://doi.org/10.1017/S0960129500070079.
  63. Luc Segoufin. Constant delay enumeration for conjunctive queries. ACM SIGMOD Record, 44(1):10-17, 2015. URL: https://doi.org/10.1145/2783888.2783894.
  64. Luc Segoufin and Alexandre Vigny. Constant delay enumeration for FO queries over databases with local bounded expansion. In Proceedings of the 20th International Conference on Database Theory, ICDT 2017, volume 68 of LIPIcs, pages 20:1-20:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.ICDT.2017.20.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact