Relative expressive power of navigational querying on graphs using transitive closure
From MaRDI portal
Publication:4644599
Recommendations
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs
- Relative expressive power of navigational querying on graphs
- The power of Tarski's relation algebra on trees
- On the power of deterministic transitive closures
Cited in
(10)- The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs
- The power of Tarski's relation algebra on trees
- Evaluation and enumeration problems for regular path queries
- On the expressive power of query languages for matrices
- Structural characterizations of the navigational expressiveness of relation algebras on a tree
- Executable first-order queries in the logic of information flows
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- Relative expressive power of navigational querying on graphs
- A framework for comparing query languages in their ability to express Boolean queries
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
This page was built for publication: Relative expressive power of navigational querying on graphs using transitive closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644599)