Document Open Access Logo

The First Order Truth Behind Undecidability of Regular Path Queries Determinacy

Authors Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja



PDF
Thumbnail PDF

File

LIPIcs.ICDT.2019.15.pdf
  • Filesize: 1.21 MB
  • 18 pages

Document Identifiers

Author Details

Grzegorz Głuch
  • Institute of Computer Science, University of Wrocław, Poland
Jerzy Marcinkowski
  • Institute of Computer Science, University of Wrocław, Poland
Piotr Ostropolski-Nalewaja
  • Institute of Computer Science, University of Wrocław, Poland

Cite AsGet BibTex

Grzegorz Głuch, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja. The First Order Truth Behind Undecidability of Regular Path Queries Determinacy. In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, pp. 15:1-15:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ICDT.2019.15

Abstract

In our paper [Głuch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path Queries. Here a strong generalisation of this result is shown, and - we think - a very unexpected one. We prove that no regularity is needed: determinacy remains undecidable even for finite unions of conjunctive path queries.

Subject Classification

ACM Subject Classification
  • Information systems → Graph-based database models
Keywords
  • database theory
  • query
  • view
  • determinacy
  • recursive path queries

Metrics

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

References

  1. Serge Abiteboul and Victor Vianu. Regular Path Queries with Constraints. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '97, pages 122-133, New York, NY, USA, 1997. ACM. URL: http://dx.doi.org/10.1145/263661.263676.
  2. Foto N. Afrati. Determinacy and query rewriting for conjunctive queries and views. Theoretical Computer Science, 412(11):1005-1021, 2011. URL: http://dx.doi.org/10.1016/j.tcs.2010.12.031.
  3. Pablo Barceló. Querying graph databases. In PODS, 2013. Google Scholar
  4. Peter Buneman, Wenfei Fan, and Scott Weinstein. Path Constraints in Semistructured Databases. Journal of Computer and System Sciences, 61(2):146-193, 2000. URL: http://dx.doi.org/10.1006/jcss.2000.1710.
  5. D. Calvanese, G. de Giacomo, M. Lenzerini, and M. Y. Vardi. View-based query processing and constraint satisfaction. In Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pages 361-371, June 2000. URL: http://dx.doi.org/10.1109/LICS.2000.855784.
  6. D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Answering regular path queries using views. In Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073), pages 389-398, February 2000. URL: http://dx.doi.org/10.1109/ICDE.2000.839439.
  7. Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. On the Decidability of Query Containment Under Constraints. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '98, pages 149-158, New York, NY, USA, 1998. ACM. URL: http://dx.doi.org/10.1145/275487.275504.
  8. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Rewriting of Regular Expressions and Regular Path Queries. In Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99, pages 194-204, New York, NY, USA, 1999. ACM. URL: http://dx.doi.org/10.1145/303976.303996.
  9. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Lossless Regular Views. In Proceedings of the Twenty-first ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '02, pages 247-258, New York, NY, USA, 2002. ACM. URL: http://dx.doi.org/10.1145/543613.543646.
  10. Mariano P. Consens and Alberto O. Mendelzon. GraphLog: a Visual Formalism for Real Life Recursion. In PODS, 1990. Google Scholar
  11. Isabel F. Cruz, Alberto O. Mendelzon, and Peter T. Wood. A Graphical Query Language Supporting Recursion. In Proceedings of the 1987 ACM SIGMOD International Conference on Management of Data, SIGMOD '87, pages 323-330, New York, NY, USA, 1987. ACM. URL: http://dx.doi.org/10.1145/38713.38749.
  12. Wenfei Fan, Floris Geerts, and Lixiao Zheng. View determinacy for preserving selected information in data transformations. Inf. Syst., 37:1-12, 2012. Google Scholar
  13. Daniela Florescu, Alon Levy, and Dan Suciu. Query Containment for Conjunctive Queries with Regular Expressions. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS '98, pages 139-148, New York, NY, USA, 1998. ACM. URL: http://dx.doi.org/10.1145/275487.275503.
  14. Nadime Francis. Vues et requetes sur les graphes de donnees: determinabilite et reecritures. PhD thesis, Ecole Normale Superieure de Cacha, 2015. Google Scholar
  15. Nadime Francis. Asymptotic Determinacy of Path Queries Using Union-of-Paths Views. Theory of Computing Systems, 61:156-190, 2016. Google Scholar
  16. Grzegorz Gluch, Jerzy Marcinkowski, and Piotr Ostropolski-Nalewaja. Can One Escape Red Chains?: Regular Path Queries Determinacy is Undecidable. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '18, pages 492-501, New York, NY, USA, 2018. ACM. URL: http://dx.doi.org/10.1145/3209108.3209120.
  17. Tomasz Gogacz and Jerzy Marcinkowski. The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable. In Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), LICS '15, pages 281-292, Washington, DC, USA, 2015. IEEE Computer Society. URL: http://dx.doi.org/10.1109/LICS.2015.35.
  18. Tomasz Gogacz and Jerzy Marcinkowski. Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16, pages 121-134, New York, NY, USA, 2016. ACM. URL: http://dx.doi.org/10.1145/2902251.2902288.
  19. V. Juge and Moshe Vardi. On the containment of Datalog in Regular Datalog. Technical report, Rice University, 2009. Google Scholar
  20. Per-Åke Larson and H. Z. Yang. Computing Queries from Derived Relations. In Proceedings of the 11th International Conference on Very Large Data Bases - Volume 11, VLDB '85, pages 259-269. VLDB Endowment, 1985. URL: http://dl.acm.org/citation.cfm?id=1286760.1286784.
  21. Alan Nash, Luc Segoufin, and Victor Vianu. Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. In Thomas Schwentick and Dan Suciu, editors, Database Theory - ICDT 2007, pages 59-73, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg. Google Scholar
  22. Alan Nash, Luc Segoufin, and Victor Vianu. Views and Queries: Determinacy and Rewriting. ACM Trans. Database Syst., 35(3):21:1-21:41, July 2010. URL: http://dx.doi.org/10.1145/1806907.1806913.
  23. Daniel Pasailă. Conjunctive Queries Determinacy and Rewriting. In Proceedings of the 14th International Conference on Database Theory, ICDT '11, pages 220-231, New York, NY, USA, 2011. ACM. URL: http://dx.doi.org/10.1145/1938551.1938580.
  24. Juan L. Reutter, Miguel Romero, and Moshe Y. Vardi. Regular Queries on Graph Databases. Theor. Comp. Sys., 61(1):31-83, July 2017. URL: http://dx.doi.org/10.1007/s00224-016-9676-2.
  25. Hartley Rogers, Jr. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA, USA, 1987. Google Scholar
  26. Moshe Y. Vardi. A Theory of Regular Queries. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16, pages 1-9, New York, NY, USA, 2016. ACM. URL: http://dx.doi.org/10.1145/2902251.2902305.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail