Relative expressive power of navigational querying on graphs using transitive closure
From MaRDI portal
Publication:4644599
DOI10.1093/JIGPAL/JZV028zbMATH Open1407.68134OpenAlexW891387922MaRDI QIDQ4644599FDOQ4644599
Authors: Dimitri Surinx, George H. L. Fletcher, Dirk Leinders, Jan Van den Bussche, Stijn Vansummeren, Yuqing Wu, Marc Gyssens, D. Van Gucht 
Publication date: 8 January 2019
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/19b4b379f1ba8800b365dcc507fdff3fd1765705
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 power of Tarski's relation algebra on trees
- Executable first-order queries in the logic of information flows
- Evaluation and enumeration problems for regular path queries
- The impact of transitive closure on the Boolean expressiveness of navigational query languages on graphs
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- On the expressive power of query languages for matrices
- Structural characterizations of the navigational expressiveness of relation algebras on a tree
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity
- Relative expressive power of navigational querying on graphs
- A framework for comparing query languages in their ability to express Boolean queries
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)
