Static analysis of navigational XPath over graph databases
From MaRDI portal
Recommendations
- Containment and equivalence for a fragment of XPath
- Containment of queries for graphs with data
- Expressiveness and static analysis of extended conjunctive regular path queries
- The complexity of query containment in expressive fragments of XPath 2.0
- Relative expressive power of navigational querying on graphs
Cites work
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- A Modal Perspective on Path Constraints
- Parameterized regular expressions and their languages
- Remarks on Berger's paper on the domino problem
- The complexity of query containment in expressive fragments of XPath 2.0
- Well-structured program equivalence is highly undecidable
- XPath satisfiability in the presence of DTDs
Cited in
(5)- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- An Algebra for Path Manipulation in Graph Databases
- Expressiveness and static analysis of extended conjunctive regular path queries
- Containment of queries for graphs with data
- Navigational and rule-based languages for graph databases
This page was built for publication: Static analysis of navigational XPath over graph databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269725)
