Relative expressive power of navigational querying on graphs
From MaRDI portal
Publication:528686
DOI10.1016/J.INS.2014.11.031zbMath1360.68394arXiv1401.8201OpenAlexW2962721563MaRDI QIDQ528686
Dirk Leinders, Dimitri Surinx, Marc Gyssens, George H. L. Fletcher, Stijn Vansummeren, Dirk Van Gucht, Jan Van den Bussche, Yuqing Wu
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.8201
Related Items (8)
Semantic Acyclicity on Graph Databases ⋮ Regular queries on graph databases ⋮ Inputs, Outputs, and Composition in the Logic of Information Flows ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ Relative expressive power of navigational querying on graphs ⋮ The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs ⋮ A framework for comparing query languages in their ability to express Boolean queries
Uses Software
Cites Work
- Relative expressive power of navigational querying on graphs
- Structural properties of XPath fragments
- Relation algebras by games
- Relation algebras
- Multi-dimensional modal logic
- Program constructions that are safe for bisimulation
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs
- First-order logic with two variables and unary temporal logic
- Forward node-selecting queries over trees
- PDL with intersection and converse: satisfiability and infinite-state model checking
- Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relative expressive power of navigational querying on graphs
