Containment of queries for graphs with data
From MaRDI portal
Recommendations
- Querying Graphs with Data
- On the data complexity of consistent query answering over graph databases
- On the data complexity of consistent query answering over graph databases
- Querying graphs
- Expressive path queries on graphs with data
- Expressive path queries on graph with data
- scientific article; zbMATH DE number 1951561
Cites work
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2241908 (Why is no real title available?)
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Parameterized regular expressions and their languages
- Regular expressions for data words
- Static analysis of navigational XPath over graph databases
Cited in
(7)- Querying Graphs with Data
- Decidable containment of recursive queries
- Static analysis of navigational XPath over graph databases
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Regular queries on graph databases
- Regular queries on graph databases
- Querying relational event graphs using colored range searching data structures
This page was built for publication: Containment of queries for graphs with data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678169)
