Static analysis of navigational XPath over graph databases

DOI10.1016/j.ipl.2016.03.006zbMath1356.68053OpenAlexW2301030643MaRDI QIDQ269725

Domagoj Vrgoč, Egor V. Kostylev, Juan L. Reutter

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:8cd697f2-d481-4ca9-a631-81b20a26eb4b

zbMATH Keywords

static analysisquery languagesdatabasesgraph databases

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Containment of queries for graphs with data ⋮ Navigational and Rule-Based Languages for Graph Databases

Uses Software

• XPath
• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized regular expressions and their languages
• Remarks on Berger's paper on the domino problem
• Well-structured program equivalence is highly undecidable
• The complexity of query containment in expressive fragments of XPath 2.0
• XPath satisfiability in the presence of DTDs
• A Modal Perspective on Path Constraints

This page was built for publication: Static analysis of navigational XPath over graph databases