License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2019.15
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10317/
Go to the corresponding LIPIcs Volume Portal


Gluch, Grzegorz ; Marcinkowski, Jerzy ; Ostropolski-Nalewaja, Piotr

The First Order Truth Behind Undecidability of Regular Path Queries Determinacy

pdf-format:
LIPIcs-ICDT-2019-15.pdf (1 MB)


Abstract

In our paper [Gluch, 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.

BibTeX - Entry

@InProceedings{gluch_et_al:LIPIcs:2019:10317,
  author =	{Grzegorz Gluch and Jerzy Marcinkowski and Piotr Ostropolski-Nalewaja},
  title =	{{The First Order Truth Behind Undecidability of Regular Path Queries Determinacy}},
  booktitle =	{22nd International Conference on Database Theory (ICDT 2019)},
  pages =	{15:1--15:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-101-6},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{127},
  editor =	{Pablo Barcelo and Marco Calautti},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10317},
  doi =		{10.4230/LIPIcs.ICDT.2019.15},
  annote =	{Keywords: database theory, query, view, determinacy, recursive path queries}
}

Keywords: database theory, query, view, determinacy, recursive path queries
Seminar: 22nd International Conference on Database Theory (ICDT 2019)
Issue Date: 2019
Date of publication: 19.03.2019


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI