Containment of regular path queries under path constraints

DOI10.4230/LIPICS.ICDT.2024.17MaRDI QIDQ6902071zbMATH OpenFDO

Authors S. Salvati, Sophie Tison

Publication date 11 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2024.17

zbMATH Keywords

graph databasesdecision problemsfinite controllabilityquery containmentrewrite systemsTGDsrational path queriesword constraints

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• Converging to the chase -- a tool for finite controllability
• Match-bounded string rewriting systems
• On the Decidability of Grammar Problems
• On the data complexity of consistent query answering over graph databases
• On the finite controllability of conjunctive query answering in databases under open-world assumption
• Path constraints in semistructured data
• Path constraints in semistructured databases
• Regular canonical systems
• Regular path queries with constraints
• Some undecidability results concerning the property of preserving regularity
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Verification of evolving graph-structured data under expressive path constraints

This page was built for publication: Containment of regular path queries under path constraints

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