The first-order truth behind undecidability of regular path queries determinacy

DOI10.4230/LIPICS.ICDT.2019.15MaRDI QIDQ5091128zbMATH OpenFDO

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

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1808.07767

zbMATH Keywords

database theorydeterminacyqueryrecursive path queriesview

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Can One Escape Red Chains?
• On decidability of boundedness property for regular path queries
• Asymptotic determinacy of path queries using union-of-paths views
• Determinacy and query rewriting for conjunctive queries and views
• Asymptotic determinacy of path queries using union-of-paths views

Cites work

• Asymptotic determinacy of path queries using union-of-paths views
• Can One Escape Red Chains?
• Determinacy and query rewriting for conjunctive queries and views
• scientific article; zbMATH DE number 219218 (Why is no real title available?)
• Path constraints in semistructured databases
• Regular path queries with constraints
• Regular queries on graph databases
• Rewriting of regular expressions and regular path queries
• The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable

Cited in

(3)

• Can One Escape Red Chains?
• Fine-Grained Complexity of Regular Path Queries
• Fine-grained complexity of regular path queries

This page was built for publication: The first-order truth behind undecidability of regular path queries determinacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091128)